Total coloring of planar graphs without adjacent short cycles

DOI10.1007/S10878-015-9954-YMaRDI QIDQ512886zbMATH OpenOpenAlexFDO

Authors Yan Gu, Weili Wu, Bin Liu, Xin Zhang, Huijuan Wang, Hongwei Gao

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

zbMATH Keywords

planar graphstotal coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• A note on the minimum total coloring of planar graphs
• Minimum total coloring of planar graph
• Total colorings of planar graphs without adjacent 5-cycles.
• Total colorings of planar graphs without chordal 6-cycles
• Total coloring of planar graphs without short cycles

Cites work

• scientific article; zbMATH DE number 2192154 (Why is no real title available?)
• Determining the total colouring number is NP-hard
• Edge and total coloring of interval graphs
• Graph theory with applications
• List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
• Minimum total coloring of planar graph
• On total 9-coloring planar graphs of maximum degree seven
• Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
• The \(r\)-acyclic chromatic number of planar graphs
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total coloring of planar graphs of maximum degree eight
• Total coloring of planar graphs with maximum degree 8
• Total colorings and list total colorings of planar graphs without intersecting 4-cycles
• Total colorings of planar graphs with maximum degree at least 8
• Total colouring regular bipartite graphs is NP-hard
• Total colourings of graphs
• Total-Coloring of Plane Graphs with Maximum Degree Nine

Cited in

(18)

• Total coloring of planar graphs with 7-cycles containing at most two chords
• Total colorings-a survey
• Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
• \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles
• A note on the total coloring of planar graphs without adjacent 4-cycles
• Total colorings of planar graphs without intersecting 5-cycles
• Total colorings of planar graphs without adjacent 5-cycles.
• Minimum total coloring of planar graphs with maximum degree 8
• Minimum total coloring of planar graph
• Total colorings of planar graphs without 5-cycles and adjacent 6-cycles
• An efficient case for computing minimum linear arboricity with small maximum degree
• Total colorings of planar graphs without adjacent triangles
• Planar graphs without normally adjacent short cycles
• Total coloring of planar graphs without adjacent chordal 6-cycles
• Incidence coloring of planar graphs without adjacent small cycles
• Total coloring of planar graphs without some adjacent cycles
• Total coloring of planar graphs without chordal short cycles
• Planar graph colorings without short monochromatic cycles

This page was built for publication: Total coloring of planar graphs without adjacent short cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512886)