Total coloring of planar graphs without adjacent short cycles
From MaRDI portal
Publication:512886
DOI10.1007/S10878-015-9954-YzbMath1367.05081OpenAlexW2175029141MaRDI QIDQ512886
Weili Wu, Yan Gu, Xin Zhang, Bin Liu, Hong Wei Gao, Hui-Juan Wang
Publication date: 3 March 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9954-y
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 adjacent chordal 6-cycles ⋮ An efficient case for computing minimum linear arboricity with small maximum degree ⋮ Total coloring of planar graphs with 7-cycles containing at most two chords ⋮ Total coloring of planar graphs without some adjacent cycles ⋮ Total colorings-a survey ⋮ Minimum total coloring of planar graphs with maximum degree 8 ⋮ Total colorings of planar graphs without intersecting 5-cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Total coloring of planar graphs with maximum degree 8
- Minimum total coloring of planar graph
- Determining the total colouring number is NP-hard
- 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 with maximum degree at least 8
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- Total colouring regular bipartite graphs is NP-hard
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colourings of graphs
- The \(r\)-acyclic chromatic number of planar graphs
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- On total 9-coloring planar graphs of maximum degree seven
- Edge and total coloring of interval graphs
This page was built for publication: Total coloring of planar graphs without adjacent short cycles
