MathCastle
Graph TheoryEasyEulerian and Hamiltonian Graphs

Eulerian and Hamiltonian Graphs · Easy problem

A graph GG has vertices 1,2,3,4,51,2,3,4,5 and edges 12,23,34,45,51,1312, 23, 34, 45, 51, 13 (a 55-cycle with one chord). How many vertices of GG have odd degree?