Total coloring of outer-1-planar graphs: the cold case

DOI10.1007/978-3-030-57602-8_42zbMath1482.05114OpenAlexW3048312081MaRDI QIDQ2039699

Weichan Liu, Xin Zhang

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_42

zbMATH Keywords

total coloringmaximum degreeouter-1-planar graph

Mathematics Subject Classification ID

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

Related Items (1)

The structure and the list 3-dynamic coloring of outer-1-planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Outer 1-planar graphs
• List total coloring of pseudo-outerplanar graphs
• Edge covering pseudo-outerplanar graphs with forests
• The edge chromatic number of outer-1-planar graphs
• The total coloring of a multigraph with maximal degree 4
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total coloring of outer-1-planar graphs with near-independent crossings
• Light paths and edges in families of outer-1-planar graphs
• Linear arboricity of outer-1-planar graphs
• On the total coloring of certain graphs
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• On Total Chromatic Number of a Graph

This page was built for publication: Total coloring of outer-1-planar graphs: the cold case