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
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 1997年 / 70卷 / 01期
基金：
美国国家科学基金会;
关键词：
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 条
12345