On total chromatic number of planar graphs without 4-cycles
From MaRDI portal
Publication:2372576
DOI10.1007/s11434-007-2031-xzbMath1122.05037MaRDI QIDQ2372576
Min-Le Shangguan, Qiao Li, Ying Qian Wang
Publication date: 30 July 2007
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11434-007-2031-x
05C15: Coloring of graphs and hypergraphs
Related Items
Total colorings-a survey, Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable, Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable, On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles, The total chromatic number of regular graphs of high degree, Total colorings of planar graphs with maximum degree at least 8, On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles, \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle, A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable
Cites Work
- Unnamed Item
- Unnamed Item
- The total coloring of a multigraph with maximal degree 4
- The 4-choosability of plane graphs without 4-cycles
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colourings of graphs
- On the total coloring of certain graphs
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven