Balanced colourings and the four colour conjecture
J. Adrian Bondy · Proceedings of the American Mathematical Society · 1972
A conjectured property of bridgeless cubic planar graphs is shown to be equivalent to the four colour conjecture. In establishing this equivalence use is made of the König-Hall theorem on the existence of one-factors in bipartite graphs.