Total coloring of outer-1-planar graphs with near-independent crossings
From MaRDI portal
(Redirected from Publication:1680477)
Recommendations
Cites work
- scientific article; zbMATH DE number 3924797 (Why is no real title available?)
- scientific article; zbMATH DE number 4085672 (Why is no real title available?)
- scientific article; zbMATH DE number 1559126 (Why is no real title available?)
- scientific article; zbMATH DE number 2192154 (Why is no real title available?)
- Drawing complete multipartite graphs on the plane with restrictions on crossings
- Edge covering pseudo-outerplanar graphs with forests
- List total coloring of pseudo-outerplanar graphs
- Outer 1-planar graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
Cited in
(8)- Total colorings-a survey
- Total coloring of outer-1-planar graphs: the cold case
- The structure and the list 3-dynamic coloring of outer-1-planar graphs
- Strong Edge Coloring of Outerplane Graphs with Independent Crossings
- Coloring plane graphs with independent crossings
- Conflict-free incidence coloring of outer-1-planar graphs
- On list \(r\)-hued coloring of outer-1-planar graphs
- List edge coloring of outer-1-planar graphs
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)