The linear arboricity of series-parallel graphs
From MaRDI portal
Publication:1586587
DOI10.1007/S373-000-8299-9zbMATH Open0963.05073OpenAlexW1965476443MaRDI QIDQ1586587FDOQ1586587
Authors: Jian-Liang Wu 
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
Recommendations
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (22)
- Title not available (Why is that?)
- Minimum number of disjoint linear forests covering a planar graph
- On the linear arboricity of graphs with treewidth at most four
- Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles
- Edge covering pseudo-outerplanar graphs with forests
- On the linear arboricity of graphs embeddable in surfaces
- The linear arboricity of planar graphs with no short cycles
- The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
- On an \(f\)-coloring generalization of linear arboricity of multigraphs
- Linear arboricity of outer-1-planar graphs
- The linear arboricity of planar graphs with maximum degree at least 5
- SOME PROPERTIES OF BINARY SERIES-PARALLEL GRAPHS
- The list linear arboricity of graphs
- The entire coloring of series-parallel graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Density of universal classes of series-parallel graphs
- The linear arboricity of \(K_5\)-minor free graphs
- An efficient case for computing minimum linear arboricity with small maximum degree
- The linear arboricity of planar graphs without 5-, 6-cycles with chords
- Title not available (Why is that?)
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)
