The linear arboricity of composition graphs
From MaRDI portal
Recommendations
Cited in
(13)- On the linear arboricity of graphs with treewidth at most four
- Linear arboricity of Cartesian products of graphs
- Linear arboricity of the tensor products of graphs
- The linear arboricity of \(K_5\)-minor free graphs
- The linear arboricity of planar graphs without 5-, 6-cycles with chords
- The linear arboricity of planar graphs with no short cycles
- On the linear arboricity of graphs embeddable in surfaces
- scientific article; zbMATH DE number 1123795 (Why is no real title available?)
- scientific article; zbMATH DE number 4085704 (Why is no real title available?)
- scientific article; zbMATH DE number 3989394 (Why is no real title available?)
- Linear arboricity of regular digraphs
- The linear arboricity of planar graphs with maximum degree at least 5
- The list linear arboricity of planar graphs with 7-cycles containing at most two chords
This page was built for publication: The linear arboricity of composition graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1868953)