MathCastle
Graph TheoryMediumEulerian and Hamiltonian Graphs

Eulerian and Hamiltonian Graphs · Medium problem

The complete bipartite graph K3,4K_{3,4} has one side with 33 vertices and the other with 44, with an edge between every vertex on one side and every vertex on the other. Does K3,4K_{3,4} have a Hamiltonian cycle?