The linear arboricity of series-parallel graphs
From MaRDI portal
Publication:1586587
DOI10.1007/S373-000-8299-9zbMath0963.05073OpenAlexW1965476443MaRDI QIDQ1586587
Publication date: 14 November 2000
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s373-000-8299-9
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (17)
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 ⋮ The list linear arboricity of graphs ⋮ Minimum number of disjoint linear forests covering a planar graph ⋮ On the linear arboricity of graphs with treewidth at most four ⋮ On an \(f\)-coloring generalization of linear arboricity of multigraphs ⋮ Edge covering pseudo-outerplanar graphs with forests ⋮ Unnamed Item ⋮ The linear arboricity of planar graphs with maximum degree at least 5 ⋮ Unnamed Item ⋮ 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 linear arboricity of planar graphs with no short cycles ⋮ Linear arboricity of outer-1-planar graphs ⋮ The linear arboricity of \(K_5\)-minor free graphs ⋮ The entire coloring of series-parallel graphs
This page was built for publication: The linear arboricity of series-parallel graphs
