《山东大学学报(理学版)》 ›› 2021, Vol. 56 ›› Issue (11): 71-75.doi: 10.6040/j.issn.1671-9352.0.2020.358
• • 上一篇
谭香
TAN Xiang
摘要： 设G是最大度Δ≥6且不含5-圈的平面图,若G的最大度点不关联8-圈,则有χ″(G)=Δ+1。
中图分类号:
| [1] BONDY J A, MURTY U S R. Networks[M] //Graph Theory with Applications. London: Macmillan Education UK, 1976: 191-211. [2] BEHZAD M. Graphs and their chromatic numbers[D]. Michigan: Michigan State University, 1965. [3] VIZING V G. Some unsolved problems in graph theory[J]. Russian Mathematical Surveys, 1968, 23(6):125-141. [4] VIJAYADITYA N. On total chromatic number of a graph[J]. Journal of the London Mathematical Society, 1971,(3):405-408. [5] ROSENFELD M. On the total coloring of certain graphs[J]. Israel Journal of Mathematics, 1971, 9(3):396-402. [6] KOSTOCHKA A V. Upper bounds of chromatic functions on graphs[D]. Novosibirsk:[s,L] , 1978. [7] KOSTOCHKA A V. The total chromatic number of any multigraph with maximum degree five is at most seven[J]. Discrete Mathematics, 1996, 162(1/2/3):199-214. [8] SANDERS D P, ZHAO Y. On total 9-coloring planar graphs of maximum degree seven[J]. Journal of Graph Theory, 1999, 31(1):67-73. [9] BORODIN O V, KOSTOCHKA A V, WOODALL D R. Total colorings of planar graphs with large maximum degree[J]. Journal of Graph Theory, 1997, 26(1):53-59. [10] WANG W F. Total chromatic number of planar graphs with maximum degree ten[J]. Journal of Graph Theory, 2007, 54(2):91-102. [11] KOWALIK Ł, SERENI J S, ŠKREKOVSKI R. Total-coloring of plane graphs with maximum degree nine[J]. SIAM Journal on Discrete Mathematics, 2008, 22(4):1462-1479. [12] 蔡华. 平面图的若干染色问题[D]. 济南: 山东大学, 2016. CAI Hua. Some coloring problems of planar graphs[D]. Jinan: Shandong University, 2016. [13] HOU J F, LIU B, LIU G Z, et al. Total coloring of planar graphs without 6-cycles[J]. Discrete Applied Mathematics, 2011, 159(2/3):157-163. [14] SHEN L, WANG Y Q. Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable[J]. Discrete Mathematics, 2010, 310(17/18):2372-2379. [15] SHEN L, WANG Y Q. On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles[J]. Graphs and Combinatorics, 2009, 25(3):401-407. |
| [1] | 马丽丽,戴迪,李强. δ-Jordan李超三系的构造和交换扩张[J]. 《山东大学学报(理学版)》, 2021, 56(8): 76-80. |
| [2] | 张生桂,陈祥恩. 近完全图的点可区别Ⅰ-全染色及Ⅵ-全染色[J]. 《山东大学学报(理学版)》, 2021, 56(5): 23-25. |
| [3] | 杨佳睿,陈祥恩. K3,3,p的点可区别的一般全染色[J]. 《山东大学学报(理学版)》, 2021, 56(1): 18-23. |
| [4] | 王笔美,李敬文,顾彦波,邵淑宏. 单圈图的边幻和全标号[J]. 《山东大学学报(理学版)》, 2020, 55(9): 42-50. |
| [5] | 刘卓雅,徐常青. 无相交三角形平面图的邻点可区别边染色[J]. 《山东大学学报(理学版)》, 2020, 55(9): 36-41. |
| [6] | 牛蓓,张欣. 反d-退化图中的点不交3-圈[J]. 《山东大学学报(理学版)》, 2020, 55(9): 51-53. |
| [7] | 马丽丽,李强. δ-李color代数的交换扩张[J]. 《山东大学学报(理学版)》, 2020, 55(8): 38-42. |
| [8] | 陈宏宇,钟斌. 不含相交5-圈的平面图的线性2-荫度[J]. 《山东大学学报(理学版)》, 2020, 55(7): 38-45. |
| [9] | 寇艳芳,陈祥恩,王治文. K1,3,p和 K1,4,p的点可区别的IE-全染色及一般全染色[J]. 山东大学学报（理学版）, 2018, 53(8): 53-60. |
| [10] | 陈洪玲,王慧娟,高红伟. 可嵌入到欧拉示性数非负的曲面图的线性荫度[J]. 《山东大学学报(理学版)》, 2018, 53(12): 17-22. |
| [11] | 李强,马丽丽,王晓燕,吕莉娇. Hom-Jordan李代数的交换扩张[J]. 《山东大学学报(理学版)》, 2018, 53(12): 4-8. |
| [12] | 包丽娅,陈祥恩,王治文. 完全二部图K10,n(10≤n≤90)的点可区别E-全染色[J]. 《山东大学学报(理学版)》, 2018, 53(12): 23-30. |
| [13] | 刘佳,孙磊. 不含4-圈或弦6-圈的平面图是(3,0,0)-可染的[J]. 《山东大学学报(理学版)》, 2018, 53(12): 31-40. |
| [14] | 房启明,张莉. 无4-圈和5-圈的平面图的k-frugal列表染色[J]. 山东大学学报（理学版）, 2018, 53(10): 35-41. |
| [15] | 王晓丽,王慧娟,刘彬. 最大度为7的平面图全染色[J]. 山东大学学报（理学版）, 2017, 52(8): 100-106. |
|
||
