Total colorings of planar graphs with large maximum degree

被引：1
作者：
Borodin, OV
Kostochka, AV
Woodall, DR
机构：
[1] RUSSIAN ACAD SCI,NOVOSIBIRSK 630090,RUSSIA
[2] UNIV NOTTINGHAM,DEPT MATH,NOTTINGHAM NG7 2RD,ENGLAND
来源：
JOURNAL OF GRAPH THEORY | 1997年 / 26卷 / 01期
关键词：
total coloring; planar-graphs; discharging;
D O I：
10.1002/(SICI)1097-0118(199709)26:1<53::AID-JGT6>3.3.CO;2-8
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
It is proved that a planar graph with maximum degree Delta greater than or equal to 11 has total (vertex-edge) chromatic number Delta + 1. (C) 1997 John Wiley & Sons, Inc.
引用
收藏
页码：53 / 59
页数：7
相关论文
共 12 条
[1]  
[Anonymous], 1968, USPEKHIMAT NAUK
[2]  
Behzad M., 1965, THESIS MICHIGAN STAT
[3]  
BORODIN OV, 1989, J REINE ANGEW MATH, V394, P180
[4]  
BORODIN OV, UNPUB TOTAL COLOURIN
[5]  
Erdo P., 1980, Congr. Numer., P125
[6]  
JENSEN TR, 1995, GRAPH COLORING PROBL, P88
[7]  
Kostochka A.V., 1978, Upper bounds of chromatic functions of graphs
[8]   TOTAL COLORING OF A MULTI-GRAPH WITH MAXIMAL DEGREE-4 [J].
KOSTOCHKA, AV .
DISCRETE MATHEMATICS, 1977, 17 (02) :161-163
[9]   The total chromatic number of any multigraph with maximum degree five is at most seven [J].
Kostochka, AV .
DISCRETE MATHEMATICS, 1996, 162 (1-3) :199-214
[10]   TOTAL COLORING OF CERTAIN GRAPHS [J].
ROSENFELD, M .
ISRAEL JOURNAL OF MATHEMATICS, 1971, 9 (03) :396-+
12