The linear arboricity of series-parallel graphs
From MaRDI portal
Recommendations
Cited in
(24)- Linear arboricity of outer-1-planar graphs
- The linear arboricity of \(K_5\)-minor free graphs
- Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles
- The linear arboricity of planar graphs without 5-, 6-cycles with chords
- An efficient case for computing minimum linear arboricity with small maximum degree
- On the linear arboricity of graphs embeddable in surfaces
- The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
- The entire coloring of series-parallel graphs
- Density of universal classes of series-parallel graphs
- Minimum number of disjoint linear forests covering a planar graph
- scientific article; zbMATH DE number 729923 (Why is no real title available?)
- Edge covering pseudo-outerplanar graphs with forests
- scientific article; zbMATH DE number 1560506 (Why is no real title available?)
- The linear arboricity of planar graphs with maximum degree at least 5
- scientific article; zbMATH DE number 844157 (Why is no real title available?)
- SOME PROPERTIES OF BINARY SERIES-PARALLEL GRAPHS
- The list linear arboricity of graphs
- Linear arboricity of 1-planar graphs
- Linear arboricity of IC-planar graphs
- On the linear arboricity of graphs with treewidth at most four
- On an f-coloring generalization of linear arboricity of multigraphs
- Linear arboricity of the tensor products of complete multipartite graphs
- The linear arboricity of graphs with low treewidth
- The linear arboricity of planar graphs with no short cycles
This page was built for publication: The linear arboricity of series-parallel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586587)