Covering planar graphs with forests

DOI10.1016/J.JCTB.2004.12.002zbMATH Open1059.05081OpenAlexW2161215678MaRDI QIDQ1775897FDOQ1775897

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

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

Recommendations

• Covering planar graphs with forests, one having bounded maximum degree
• Covering planar graphs with forests, one having a bounded maximum degree
• Covering a graph by forests and a matching
• Edge covering pseudo-outerplanar graphs with forests
• Covering projective planar graphs with three forests
• Covering a graph with a constrained forest (extended abstract)
• scientific article; zbMATH DE number 1556750
• Covering paths and trees for planar grids
• On covering vertices of a graph by trees
• Uniform spanning forests of planar graphs

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)

Cites Work

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

Cited In (39)

• Caterpillar arboricity of planar graphs
• Bounding clique size in squares of planar graphs
• On covering vertices of a graph by trees
• Decomposition of sparse graphs into two forests, one having bounded maximum degree
• Title not available (Why is that?)
• Soft 3-stars in sparse plane graphs
• Covering planar graphs with forests, one having a bounded maximum degree
• Title not available (Why is that?)
• Title not available (Why is that?)
• Edge covering pseudo-outerplanar graphs with forests
• Decomposition of sparse graphs into forests and a graph with bounded degree
• Light 3-stars in sparse plane graphs
• Degree bounded forest covering
• Decomposing a graph into forests: the nine dragon tree conjecture is true
• Decomposing 4-connected planar triangulations into two trees and one path
• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
• 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
• Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7
• Covering a graph with a constrained forest (extended abstract)
• Light and low 5-stars in normal plane maps with minimum degree 5
• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
• Covering planar graphs with a fixed number of balls
• Covering projective planar graphs with three forests
• Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
• Covering planar graphs with forests, one having bounded maximum degree
• Decomposing plane cubic graphs
• Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices
• Decomposing a graph into pseudoforests with one having bounded degree
• Decomposing a graph into forests
• Decomposing a planar graph with girth 9 into a forest and a matching
• Decomposition of sparse graphs, with application to game coloring number
• 5-stars of low weight in normal plane maps with minimum degree 5
• An introduction to the discharging method via graph coloring
• Low 5-stars in normal plane maps with minimum degree 5
• On the existence of specific stars in planar graphs
• Towards obtaining a 3-decomposition from a perfect matching
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1775897)