The linear arboricity of planar graphs with no short cycles
From MaRDI portal
(Redirected from Publication:995578)
Recommendations
- The linear arboricity of planar graphs without chordal short cycles
- The linear arboricity of planar graphs without 5-, 6-cycles with chords
- The linear arboricity of planar graphs without 5-cycles with chords
- The linear arboricity of planar graphs without 5-cycles with two chords
- The linear arboricity of planar graphs with maximum degree at least 7
Cites work
- scientific article; zbMATH DE number 3989394 (Why is no real title available?)
- scientific article; zbMATH DE number 4101233 (Why is no real title available?)
- scientific article; zbMATH DE number 3717365 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 1299961 (Why is no real title available?)
- COVERING AND PACKING IN GRAPHS, I.
- Complexité de l'arboricité linéaire d'un graphe
- Covering and packing in graphs IV: Linear arboricity
- Graph theory
- Linear arboricity and linear \(k\)-arboricity of regular graphs
- The linear arboricity of composition graphs
- The linear arboricity of planar graphs of maximum degree seven is four
- The linear arboricity of series-parallel graphs
- The linear arboricity of some regular graphs
Cited in
(8)- Minimum number of disjoint linear forests covering a planar graph
- Linear arboricity of 1-planar graphs
- Linear arboricity of IC-planar graphs
- The linear arboricity of planar graphs with maximum degree at least 5
- 4-圈不共点的平面图的线性2-荫度
- The linear arboricity of \(K_5\)-minor free graphs
- The list linear arboricity of planar graphs
- The linear arboricity of planar graphs without 5-, 6-cycles with chords
This page was built for publication: The linear arboricity of planar graphs with no short cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995578)