KöMaL 2016 B4762
In a simple graph, the degree of each vertex is four, and for each edge there exists exactly one vertex connected to both ends of the edge. What is the minimum number of vertices in such a graph?
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.