Total coloring of outer-1-planar graphs with near-independent crossings

DOI10.1007/s10878-016-0093-xzbMath1383.05126OpenAlexW2552011850MaRDI QIDQ1680477

Xin Zhang

Publication date: 16 November 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0093-x

zbMATH Keywords

total coloringouterplanar graphouter-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 (5)

Total colorings-a survey ⋮ List edge coloring of outer-1-planar graphs ⋮ Total coloring of outer-1-planar graphs: the cold case ⋮ On list \(r\)-hued coloring of outer-1-planar graphs ⋮ The structure and the list 3-dynamic coloring of outer-1-planar graphs

Cites Work

• Outer 1-planar graphs
• List total coloring of pseudo-outerplanar graphs
• Edge covering pseudo-outerplanar graphs with forests
• Drawing complete multipartite graphs on the plane with restrictions on crossings
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Total coloring of outer-1-planar graphs with near-independent crossings