Linear arboricity of outer-1-planar graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3924797 (Why is no real title available?)
- scientific article; zbMATH DE number 3717365 (Why is no real title available?)
- scientific article; zbMATH DE number 1299961 (Why is no real title available?)
- A linear-time algorithm for testing outer-1-planarity
- COVERING AND PACKING IN GRAPHS, I.
- Complexité de l'arboricité linéaire d'un graphe
- Edge covering pseudo-outerplanar graphs with forests
- Every outer-1-plane graph has a right angle crossing drawing
- Graph theory with applications
- List total coloring of pseudo-outerplanar graphs
- Outer 1-planar graphs
- Recognizing outer 1-planar graphs in linear time
- The linear arboricity of planar graphs of maximum degree seven is four
- The linear arboricity of series-parallel graphs
Cited in
(4)
This page was built for publication: Linear arboricity of outer-1-planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033994)