Walks, Paths and Connectivity · Hard problem

A graph on $6$ vertices is the complete graph $K_6$ on $1,\ldots,6$ with the three edges $12$, $34$, $56$ removed (so every vertex is adjacent to every other vertex except one specific partner). How many triangles does this graph contain?