Kőnig’s edge-colouring theorem for all graphs

Denis Cornaz , Viet Hung Nguyen (1)

1 DECISION

We show that the maximum degree of a graph GG is equal to the minimum number of ocm sets covering GG, where an ocm set is the vertex-disjoint union of elementary odd cycles and one matching, and a collection of ocm sets covers GG if every edge is in the matching of an ocm set or in some odd cycle of at least two ocm sets.

Domaines: Informatique [cs]

Denis Cornaz, Viet Hung Nguyen. Kőnig’s edge-colouring theorem for all graphs. Operations Research Letters, 2013, 41 (6), pp.592-596. ⟨10.1016/j.orl.2013.08.005⟩. ⟨hal-01170508⟩