Total coloring of planar graphs without chordal short cycles
From MaRDI portal
Publication:497376
DOI10.1007/s00373-014-1449-6zbMath1321.05093OpenAlexW2029576723MaRDI QIDQ497376
Jian Liang Wu, Bin Liu, Hui-Juan Wang
Publication date: 24 September 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1449-6
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 ⋮ A note on the minimum total coloring of planar graphs ⋮ Total coloring of planar graphs with 7-cycles containing at most two chords ⋮ Total colorings-a survey ⋮ Total colorings of planar graphs without intersecting 5-cycles ⋮ Total coloring of planar graphs without some chordal 6-cycles
Cites Work
- Unnamed Item
- A note on the total coloring of planar graphs without adjacent 4-cycles
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- Total coloring of planar graphs without 6-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
- Total colorings of planar graphs without adjacent triangles
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- Total colorings of planar graphs with maximum degree at least 8
- 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 colourings of graphs
- Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
- Total chromatic number of planar graphs with maximum degree ten
- 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
This page was built for publication: Total coloring of planar graphs without chordal short cycles
