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

DOI10.1007/S10878-016-0093-XzbMATH Open1383.05126OpenAlexW2552011850MaRDI QIDQ1680477FDOQ1680477

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

Recommendations

• scientific article; zbMATH DE number 6795582
• Total colorings of planar graphs without adjacent 5-cycles.
• On total colorings of some special 1-planar graphs
• Total colorings of planar graphs without adjacent triangles
• Total colorings of planar graphs without chordal 6-cycles

zbMATH Keywords

outerplanar graphtotal 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

• Title not available (Why is that?)
• Edge covering pseudo-outerplanar graphs with forests
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Outer 1-planar graphs
• Drawing complete multipartite graphs on the plane with restrictions on crossings
• 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?)

Cited In (8)

• Total colorings-a survey
• The structure and the list 3-dynamic coloring of outer-1-planar graphs
• Total coloring of outer-1-planar graphs: the cold case
• List edge coloring of outer-1-planar graphs
• Conflict-free incidence coloring of outer-1-planar graphs
• Strong Edge Coloring of Outerplane Graphs with Independent Crossings
• On list \(r\)-hued coloring of outer-1-planar graphs
• Coloring plane graphs with independent crossings

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

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