Tutte's edge-colouring conjecture

被引:29
|
作者
Robertson, N
Seymour, P
Thomas, R
机构
[1] BELLCORE,MORRISTOWN,NJ 07960
[2] GEORGIA INST TECHNOL,SCH MATH,ATLANTA,GA 30332
基金
美国国家科学基金会;
关键词
D O I
10.1006/jctb.1997.1752
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Tutte made the conjecture in 1966 that every 2-connected cubic graph not containing the Petersen graph as a minor is 3-edge-colourable. Thr conjecture is still open, but we show that ir is true, in general. provided it is true for two special kinds of cubic graphs that are almost Planar. (C) 1997 Academic Press.
引用
收藏
页码:166 / 183
页数:18
相关论文
共 50 条
  • [21] On Parsimonious Edge-Colouring of Graphs with Maximum Degree Three
    Fouquet, J. -L.
    Vanherpe, J. -M.
    GRAPHS AND COMBINATORICS, 2013, 29 (03) : 475 - 487
  • [22] An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs
    Macajova, Edita
    Mazak, Jan
    FRONTIERS IN ALGORITHMICS AND ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, (FAW-AAIM 2011), 2011, 6681 : 136 - 146
  • [23] Edge-colouring seven-regular planar graphs
    Chudnovsky, Maria
    Edwards, Katherine
    Kawarabayashi, Ken-ichi
    Seymour, Paul
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 115 : 276 - 302
  • [24] On Parsimonious Edge-Colouring of Graphs with Maximum Degree Three
    J.-L. Fouquet
    J.-M. Vanherpe
    Graphs and Combinatorics, 2013, 29 : 475 - 487
  • [25] Edge-colouring eight-regular planar graphs
    Chudnovsky, Maria
    Edwards, Katherine
    Seymour, Paul
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 115 : 303 - 338
  • [26] Approximate Strong Edge-Colouring of Unit Disk Graphs
    Grelier, Nicolas
    de Verclos, Remi de Joannis
    Kang, Ross J.
    Pirot, Francois
    APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2019), 2020, 11926 : 154 - 169
  • [27] Characterizing and edge-colouring split-indifference graphs
    Ortiz, C
    Maculan, N
    Szwarcfiter, JL
    DISCRETE APPLIED MATHEMATICS, 1998, 82 (1-3) : 209 - 217
  • [28] Rotation sequences and edge-colouring of binary tree pairs
    Gibbons, A
    Sant, P
    THEORETICAL COMPUTER SCIENCE, 2004, 326 (1-3) : 409 - 418
  • [29] Graph edge colouring: Tashkinov trees and Goldberg's conjecture
    Scheide, D.
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2010, 100 (01) : 68 - 96
  • [30] Non-proper edge-colouring of graphs and hereditary graph properties
    Dorfling, Samantha
    Maritz, Elizabeth C. M.
    Smit, Jon
    Vetrik, Tomas
    QUAESTIONES MATHEMATICAE, 2017, 40 (04) : 539 - 551