Linear arboricity of IC-planar graphs
From MaRDI portal
Publication:6148564
Recommendations
Cites work
- scientific article; zbMATH DE number 3989394 (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?)
- COVERING AND PACKING IN GRAPHS, I.
- Light structures in 1-planar graphs with an application to linear 2-arboricity
- On the linear arboricity of 1-planar graphs
- On the linear arboricity of graphs embeddable in surfaces
- The linear arboricity of planar graphs of maximum degree seven is four
- The linear arboricity of planar graphs with no short cycles
- The linear arboricity of series-parallel graphs
- The linear arboricity of some regular graphs
- The structure of plane graphs with independent crossings and its applications to coloring problems
This page was built for publication: Linear arboricity of IC-planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6148564)