A note on the total coloring of planar graphs without adjacent 4-cycles

DOI10.1016/J.DISC.2012.02.026MaRDI QIDQ427837zbMATH OpenOpenAlexFDO

Authors Jian-Liang Wu, Hui-Juan Wang

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

zbMATH Keywords

cycleplanar graphtotal 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 total colorings of planar graphs without 4-cycles
• Total colorings of planar graphs without adjacent 5-cycles.
• Total colorings of planar graphs without adjacent triangles
• Total coloring of planar graphs without adjacent short cycles
• Total colorings of planar graphs without 6-cycles and adjacent 5-cycles

Cites work

• Graph theory
• List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
• Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total chromatic number of planar graphs with maximum degree ten
• Total coloring of planar graphs with maximum degree 7
• Total coloring of planar graphs without 6-cycles
• Total colorings and list total colorings of planar graphs without intersecting 4-cycles
• Total colorings of planar graphs with large maximum degree
• Total colorings of planar graphs with maximum degree at least 8
• Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
• Total colorings of planar graphs without adjacent triangles
• Total-Coloring of Plane Graphs with Maximum Degree Nine

Cited in

(12)

• Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
• Total coloring of planar graphs with maximum degree 7
• On total chromatic number of planar graphs without 4-cycles
• 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
• Minimum total coloring of planar graph
• Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
• A note on total colorings of planar graphs without 4-cycles
• Total coloring of planar graphs without chordal short cycles
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
• Total colorings-a survey

This page was built for publication: A note on the total coloring of planar graphs without adjacent 4-cycles

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