Total coloring of planar graphs without some adjacent cycles

DOI10.1007/978-3-031-16081-3_37zbMath1525.05056MaRDI QIDQ6111630

Liting Wang, Huijuan Wang

Publication date: 7 July 2023

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

zbMATH Keywords

planar graphtotal coloringshort cycle

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Total coloring of planar graphs with maximum degree 8
• Total coloring of planar graphs without adjacent short cycles
• Determining the total colouring number is NP-hard
• Total colorings of planar graphs without small cycles
• Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
• Total colorings of planar graphs with maximum degree at least 8
• Total colouring regular bipartite graphs is NP-hard
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
• On the total coloring of certain graphs
• Total chromatic number of planar graphs with maximum degree ten
• Total-Coloring of Plane Graphs with Maximum Degree Nine
• On total 9-coloring planar graphs of maximum degree seven
• Total colorings of planar graphs with large maximum degree
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• On Total Chromatic Number of a Graph

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