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

DOI10.1007/978-3-030-57602-8_42zbMATH Open1482.05114OpenAlexW3048312081MaRDI QIDQ2039699FDOQ2039699

Authors: 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

Recommendations

• Total coloring of outer-1-planar graphs with near-independent crossings
• On total colorings of 1-planar graphs
• A note on total colorings of 1-planar graphs
• On total colorings of some special 1-planar graphs
• The total chromatic number of pseudo-outerplanar graphs

zbMATH Keywords

maximum degreetotal coloringouter-1-planar graph

Mathematics Subject Classification ID

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

Cites Work

• The total chromatic number of any multigraph with maximum degree five is at most seven
• On the total coloring of certain graphs
• On the total coloring of planar graphs.
• On total 9-coloring planar graphs of maximum degree seven
• Edge covering pseudo-outerplanar graphs with forests
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• On Total Chromatic Number of a Graph
• Outer 1-planar graphs
• The total coloring of a multigraph with maximal degree 4
• Title not available (Why is that?)
• List total coloring of pseudo-outerplanar graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The edge chromatic number of outer-1-planar graphs
• 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

Cited In (2)

• The structure and the list 3-dynamic coloring of outer-1-planar graphs
• Conflict-free incidence coloring of outer-1-planar graphs

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

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