Guichard-Combinatorics-Graph-Theory · Problem 5.2.4
Graph Theory
Mathematics — Probability · euler-circuits-and-walks
Problem
Show that if G is connected and has exactly 2k vertices of odd degree, k≥1, its edges can be partitioned into k walks. Is this true for non-connected G?