Total coloring of planar graphs without some adjacent cycles

DOI10.1007/978-3-031-16081-3_37MaRDI QIDQ6111630zbMATH OpenFDO

Authors Liting Wang, Hui-Juan Wang

Publication date 7 July 2023

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-16081-3_37

zbMATH Keywords

planar graphshort cycletotal coloring

Mathematics Subject Classification ID

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

Recommendations

• Total coloring of planar graphs without adjacent short cycles
• Total coloring of planar graphs with maximum degree 8
• Total coloring of planar graphs without 6-cycles
• Total colorings of planar graphs without 5-cycles and adjacent 6-cycles
• Total colorings of planar graphs without adjacent 5-cycles.

Cites work

• Determining the total colouring number is NP-hard
• Graph theory with applications
• On the total coloring of certain graphs
• On total 9-coloring planar graphs of maximum degree seven
• On Total Chromatic Number of a Graph
• Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• 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 8
• Total coloring of planar graphs without adjacent short cycles
• Total colorings of planar graphs with large maximum degree
• Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
• Total colorings of planar graphs with maximum degree at least 8
• Total colorings of planar graphs without small cycles
• Total colouring regular bipartite graphs is NP-hard
• Total-Coloring of Plane Graphs with Maximum Degree Nine

Cited in

(5)

• Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
• Planar graph colorings without short monochromatic cycles
• Total coloring of planar graphs without chordal short cycles
• Incidence coloring of planar graphs without adjacent small cycles
• Total colorings of planar graphs without adjacent triangles

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

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