Covering planar graphs with forests

DOI10.1016/j.jctb.2004.12.002zbMath1059.05081OpenAlexW2161215678MaRDI QIDQ1775897

József Balogh, Xingxing Yu, András Pluhár, Martin Kochol

Publication date: 4 May 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.12.002

zbMATH Keywords

Hamiltonian cyclesTreesForestsPlanar graphsGraph minorsOuterplanar graphsSeries parallel graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (31)

Low 5-stars in normal plane maps with minimum degree 5 ⋮ Decomposing 4-connected planar triangulations into two trees and one path ⋮ Light 3-stars in sparse plane graphs ⋮ Light and low 5-stars in normal plane maps with minimum degree 5 ⋮ Covering planar graphs with forests, one having a bounded maximum degree ⋮ Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) ⋮ Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices ⋮ Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps ⋮ Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5 ⋮ Decomposition of sparse graphs into two forests, one having bounded maximum degree ⋮ Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7 ⋮ Decomposing plane cubic graphs ⋮ Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices ⋮ Edge covering pseudo-outerplanar graphs with forests ⋮ Soft 3-stars in sparse plane graphs ⋮ Unnamed Item ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ Decomposing a planar graph with girth 9 into a forest and a matching ⋮ Decomposing a graph into pseudoforests with one having bounded degree ⋮ On the existence of specific stars in planar graphs ⋮ An introduction to the discharging method via graph coloring ⋮ Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices ⋮ Algorithmic complexity of weakly semiregular partitioning and the representation number ⋮ Decomposition of sparse graphs, with application to game coloring number ⋮ Decomposing a graph into forests: the nine dragon tree conjecture is true ⋮ 5-stars of low weight in normal plane maps with minimum degree 5 ⋮ Covering planar graphs with forests, one having bounded maximum degree ⋮ Decomposing a graph into forests ⋮ Covering projective planar graphs with three forests ⋮ Towards obtaining a 3-decomposition from a perfect matching ⋮ Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree

Cites Work

• Topology of series-parallel networks
• A Theorem on Planar Graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Graph Classes: A Survey
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Covering planar graphs with forests