Total coloring of outer-1-planar graphs: the cold case
From MaRDI portal
Publication:2039699
Recommendations
Cites work
- 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?)
- Edge covering pseudo-outerplanar graphs with forests
- Light paths and edges in families of outer-1-planar graphs
- Linear arboricity of outer-1-planar graphs
- List total coloring of pseudo-outerplanar graphs
- On Total Chromatic Number of a Graph
- On the total coloring of certain graphs
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- Outer 1-planar graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- The edge chromatic number of outer-1-planar graphs
- The total chromatic number of any multigraph with maximum degree five is at most seven
- The total coloring of a multigraph with maximal degree 4
- Total coloring of outer-1-planar graphs with near-independent crossings
Cited in
(2)
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)