Grinberg-Introduction-Graph-Theory · Problem 3.4

Multigraphs

Mathematics — Graph Theory · multigraph-odd-degree-path-connected

Problem

Let GG be a multigraph. Assume that GG has exactly two vertices of odd degree. Prove that these two vertices are path-connected.

Browse the problem library