A note on the total coloring of planar graphs without adjacent 4-cycles
From MaRDI portal
Publication:427837
DOI10.1016/j.disc.2012.02.026zbMath1243.05090OpenAlexW2051019454MaRDI QIDQ427837
Publication date: 18 June 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.02.026
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (7)
Total coloring of planar graphs without chordal 7-cycles ⋮ Total coloring of planar graphs without short cycles ⋮ Total coloring of planar graphs with maximum degree 8 ⋮ Total colorings-a survey ⋮ Minimum total coloring of planar graph ⋮ Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ Total coloring of planar graphs without chordal short cycles
Cites Work
- Unnamed Item
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- Total coloring of planar graphs without 6-cycles
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- Total colorings of planar graphs without adjacent 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 coloring of planar graphs with maximum degree \(7\)
- 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
- Total colorings of planar graphs with large maximum degree
This page was built for publication: A note on the total coloring of planar graphs without adjacent 4-cycles
