|
|||||
|
|
Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable |
|
| Authors: | JianSheng Cai GuangHui Wang GuiYing Yan |
| Institution: | 1. School of Mathematics and Information Sciences, Weifang University, Weifang, 261061, China 2. School of Mathematics, Shandong University, Jinan, 250100, China 3. Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, China |
| Abstract: | The minimum number of colors needed to properly color the vertices and edges of a graph G is called the total chromatic number of G and denoted by ???(G). It is shown that if a planar graph G has maximum degree ?? ? 9, then ?? ??(G) = ?? + 1. In this paper, we prove that if G is a planar graph with maximum degree 8 and without intersecting chordal 4-cycles, then ???(G) = 9. |
| Keywords: | |
| 本文献已被 CNKI SpringerLink 等数据库收录！ | |