Back to Search
Start Over
Tutte's Edge-Colouring Conjecture
- Source :
- Journal of Combinatorial Theory, Series B. (1):166-183
- Publisher :
- Academic Press.
-
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.
- Subjects :
- Discrete mathematics
Mathematics::Combinatorics
010102 general mathematics
Grinberg's theorem
0102 computer and information sciences
Nowhere-zero flow
01 natural sciences
Tutte theorem
Theoretical Computer Science
Combinatorics
Computational Theory and Mathematics
010201 computation theory & mathematics
Petersen graph
Discrete Mathematics and Combinatorics
Cubic graph
Tutte 12-cage
0101 mathematics
Tutte matrix
Polyhedral graph
Mathematics
Subjects
Details
- Language :
- English
- ISSN :
- 00958956
- Issue :
- 1
- Database :
- OpenAIRE
- Journal :
- Journal of Combinatorial Theory, Series B
- Accession number :
- edsair.doi.dedup.....fc8d3cc120b7be1d58c4c92418967ff0
- Full Text :
- https://doi.org/10.1006/jctb.1997.1752