On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles
From MaRDI portal
(Redirected from Publication:4976301)
Recommendations
Cites work
- Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles
- Linear \(k\)-arboricities on trees
- On linear k-arboricity
- On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
- On the linear k-arboricity of cubic graphs
- Planar graphs without 5-cycles or without 6-cycles
- Some problems about linear arboricity
- The linear 2-arboricity of planar graphs without adjacent short cycles
- Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
Cited in
(13)- On linear 2-arboricity of certain graphs
- Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles
- Improved upper bound of linear 2-arboricity of planar graphs
- An upper bound on the linear 2-arboricity of a planar graph
- The linear 2-arboricity of planar graphs without adjacent short cycles
- The linear 2-arboricity of planar graphs without 4-cycles
- scientific article; zbMATH DE number 6890370 (Why is no real title available?)
- 4-圈不共点的平面图的线性2-荫度
- The linear 2-arboricity of plane graphs without 4-cycles and 5-cycles
- The linear 2-arboricity of some planar graphs.
- The linear 2-arboricity of 1-planar graphs without 3-cycles
- An upper bound of the linear 2-arboricity of planar graphs with neither 5-cycles nor adjacent 4-cycles
- The linear 2-arboricity of IC-planar graphs
This page was built for publication: On the linear 2-arboricity of planar graph without normally adjacent 3-cycles and 4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976301)