Covering planar graphs with forests, one having bounded maximum degree

DOI10.1016/j.jctb.2008.07.004zbMath1205.05179OpenAlexW2082674350WikidataQ60060261 ScholiaQ60060261MaRDI QIDQ1003834

Daniel Gonçalves

Publication date: 4 March 2009

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.2008.07.004

zbMATH Keywords

planar graphstreesforestsedge partition

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Decomposing 4-connected planar triangulations into two trees and one path, Facial packing edge-coloring of plane graphs, Spectral Radius of Graphs, Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\), Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait, Bounds on the number of closed walks in a graph and its applications, Spectral radius of finite and infinite planar graphs and of graphs of bounded genus, Decomposing planar graphs into graphs with degree restrictions, Decomposition of sparse graphs into two forests, one having bounded maximum degree, Decomposing plane cubic graphs, Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs, On the game coloring index of \(F^+\)-decomposable graphs, Edge covering pseudo-outerplanar graphs with forests, Facial packing vertex-coloring of subdivided plane graphs, Decomposing a graph into pseudoforests with one having bounded degree, Facial edge ranking of plane graphs, Degree Bounded Forest Covering, Algorithmic complexity of weakly semiregular partitioning and the representation number, Decomposition of sparse graphs, with application to game coloring number, The incidence game chromatic number of \((a,d)\)-decomposable graphs, Decomposing a graph into forests: the nine dragon tree conjecture is true, 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

• Decomposing a planar graph with girth 9 into a forest and a matching
• Covering planar graphs with forests
• Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
• On the invariance of Colin de Verdière's graph parameter under clique sums
• Caterpillar arboricity of planar graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Partitioning a Planar Graph of Girth 10 into a Forest and a Matching
• Edge-partitions of planar graphs and their game coloring numbers
• Decomposition of Finite Graphs Into Forests