Total coloring of planar graphs without 6-cycles
From MaRDI portal
Publication:617651
DOI10.1016/j.dam.2010.08.025zbMath1283.05101OpenAlexW3022267896MaRDI QIDQ617651
Bin Liu, Jian Liang Wu, Jian-Feng Hou, Gui Zhen Liu
Publication date: 21 January 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.08.025
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (13)
Total coloring of planar graphs without chordal 7-cycles ⋮ Total coloring of planar graphs without adjacent chordal 6-cycles ⋮ A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable ⋮ Total coloring of planar graphs with maximum degree 8 ⋮ Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable ⋮ Total colorings-a survey ⋮ A note on the total coloring of planar graphs without adjacent 4-cycles ⋮ Total colorings of planar graphs without intersecting 5-cycles ⋮ Unnamed Item ⋮ Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable ⋮ Unnamed Item ⋮ Total coloring of planar graphs without chordal short cycles
Cites Work
- Unnamed Item
- Determining the total colouring number is NP-hard
- Total colorings of planar graphs without small cycles
- List edge and list total colorings of planar graphs without short cycles
- Total colorings of planar graphs without adjacent triangles
- 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
- The total coloring of a multigraph with maximal degree 4
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colourings of planar graphs with large girth
- Total colourings of graphs
- On the total coloring of certain graphs
- Total chromatic number of planar graphs with maximum degree ten
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- Total colorings of planar graphs with large maximum degree
- A note on total colorings of planar graphs without 4-cycles
- On Total Chromatic Number of a Graph
This page was built for publication: Total coloring of planar graphs without 6-cycles