Abstract
Tutte made the conjecture in 1966 that every 2-connected cubic graph not containing the Petersen graph as a minor is 3-edge-colourable. The conjecture is still open, but we show that it is true, in general, provided it is true for two special kinds of cubic graphs that are almost planar. © 1997 Academic Press.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Robertson, N., Seymour, P., & Thomas, R. (1997). Tutte’s edge-colouring conjecture. Journal of Combinatorial Theory. Series B, 70(1), 166–183. https://doi.org/10.1006/jctb.1997.1752
Readers over time
Readers' Seniority
Readers' Discipline
