Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
From MaRDI portal
Publication:967320
DOI10.1016/j.dam.2009.02.011zbMath1209.05077MaRDI QIDQ967320
Lan Shen, Ying Qian Wang, Ding-Zhu Du
Publication date: 28 April 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.02.011
05C15: Coloring of graphs and hypergraphs
Related Items
Total coloring of planar graphs without chordal 7-cycles, Total coloring of planar graphs without short cycles, A note on the minimum total coloring of planar graphs, Total coloring of planar graphs with maximum degree 8, Total colorings of \(F_5\)-free planar graphs with maximum degree 8, \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles, Minimum total coloring of planar graph, Total coloring of planar graphs without chordal short cycles, Total coloring of planar graphs without adjacent short cycles, Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable, Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles, Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable, \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle, Total coloring of planar graphs without adjacent chordal 6-cycles, Total colorings of planar graphs with sparse triangles, A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List edge and list total colorings of planar graphs without 4-cycles
- Total colorings of planar graphs without small cycles
- Total colorings of planar graphs without adjacent triangles
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- Total colourings of planar graphs with large girth
- On total chromatic number of planar graphs without 4-cycles
- Total chromatic number of planar graphs with maximum degree ten
- Total-Coloring of Plane Graphs with Maximum Degree Nine
