Find the smallest n for which there exists a connected regular graph on n vertices which is not a complete graph but does contain K4 as a proper subgraph.
The only thing I've found that may be useful is that any 3 vertices of K4 must for a 3-cycle.
Find the smallest n for which there exists a connected regular graph on n vertices which is not a complete graph but does contain K4 as a proper subgraph.
The only thing I've found that may be useful is that any 3 vertices of K4 must for a 3-cycle.