Total coloring of planar graphs with maximum degree 8
From MaRDI portal
Publication:393898
DOI10.1016/J.TCS.2013.12.006zbMath1279.05030OpenAlexW2917669760MaRDI QIDQ393898
Lidong Wu, Jian Liang Wu, Hui-Juan Wang
Publication date: 24 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.12.006
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
Total coloring of planar graphs without chordal 7-cycles ⋮ Total coloring of planar graphs without short cycles ⋮ Total coloring of planar graphs without some adjacent cycles ⋮ Total colorings-a survey ⋮ Minimum total coloring of planar graphs with maximum degree 8 ⋮ Total coloring of planar graphs without adjacent short cycles
Cites Work
- Unnamed Item
- Total coloring of planar graphs with 7-cycles containing at most two chords
- Total coloring of embedded graphs with maximum degree at least seven
- A note on the total coloring of planar graphs without adjacent 4-cycles
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- Total coloring of planar graphs without 6-cycles
- List edge and list total colorings of planar graphs without 4-cycles
- Total colorings of planar graphs without small cycles
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- Total coloring of planar graphs of maximum degree eight
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- On the Total Coloring of Graphs Embeddable in Surfaces
This page was built for publication: Total coloring of planar graphs with maximum degree 8
