edge-coloring

Graph Theory » Coloring » Edge coloring

Petersen coloring conjecture ★★★

Author(s): Jaeger

Conjecture Let $G$ be a cubic graph with no bridge. Then there is a coloring of the edges of $G$ using the edges of the Petersen graph so that any three mutually adjacent edges of $G$ map to three mutually adjancent edges in the Petersen graph.

Keywords: cubic; edge-coloring; Petersen graph

Posted by mdevos
updated November 24th, 2011