Linear 2-arboricity of toroidal graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 91047 (Why is no real title available?)
- scientific article; zbMATH DE number 734483 (Why is no real title available?)
- scientific article; zbMATH DE number 2192133 (Why is no real title available?)
- An improved upper bound on the linear 2-arboricity of planar graphs
- Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
- Linear \(k\)-arboricities on trees
- On linear k-arboricity
- On the linear \((n - 1)\)-arboricity of \(K_{n(m)}\)
- On the linear \(k\)-arboricity of \(K_n\) and \(K_{n,n}\)
- On the linear arboricity of graphs embeddable in surfaces
- Planar graphs without 5-cycles or without 6-cycles
- Some problems about linear arboricity
- The linear 2-arboricity of planar graphs
- The linear \((n-1)\)-arboricity of Cartesian product graphs
- Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
Cited in
(9)- On linear 2-arboricity of certain graphs
- An improved upper bound on the linear 2-arboricity of 1-planar graphs
- The linear 2-arboricity of IC-planar graphs
- Vertex arboricity of toroidal graphs with a forbidden cycle
- An improved upper bound on the linear 2-arboricity of toroidal graphs
- Linear 2-arboricity of planar graphs with maximum degree nine
- Light structures in 1-planar graphs with an application to linear 2-arboricity
- The linear 2-arboricity of 1-planar graphs without 3-cycles
- The linear 2-arboricity of sparse graphs
This page was built for publication: Linear 2-arboricity of toroidal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1714033)