Abstract
AbstractLet be a finite ‐regular graph with a proper edge coloring. An edge Kempe switch is a new proper edge coloring of obtained by switching the two colors along some bichromatic cycle. We prove that any other edge coloring can be obtained by performing finitely many edge Kempe switches, provided that is replaced with a suitable finite covering graph. The required covering degree is bounded above by a constant depending only on .
Full Text
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call