Assertion: bridgeless graph | /r/Desires | four colors
Facets:
value: in an edge coloring
type: OTHER
Source sentences:
text: Another result relating the four-color theorem to graph minors is the snark theorem announced by Robertson, Sanders, Seymour, and Thomas, a strengthening of the four-color theorem conjectured by W. T. Tutte and stating that any bridgeless 3-regular graph that requires four colors in an edge coloring must have the Petersen graph as a minor.