Problem B. 4762. (January 2016)
B. 4762. 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?
Deadline expired on February 10, 2016.
123 students sent a solution. 3 points: 86 students. 2 points: 11 students. 1 point: 5 students. 0 point: 21 students.