Decomposing a planar graph with girth 9 into a forest and a matching
From MaRDI portal
Publication:925026
DOI10.1016/j.ejc.2007.06.020zbMath1144.05019OpenAlexW1984593473WikidataQ60060259 ScholiaQ60060259MaRDI QIDQ925026
Naeem N. Sheikh, Alexandr V. Kostochka, Oleg V. Borodin, Gexin Yu
Publication date: 29 May 2008
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2007.06.020
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 (17)
Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph ⋮ 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\) ⋮ Decomposition of sparse graphs into two forests, one having bounded maximum degree ⋮ Decomposing plane cubic graphs ⋮ Thin trees in 8-edge-connected planar graphs ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ Partitioning a Planar Graph of Girth 10 into a Forest and a Matching ⋮ Degree Bounded Forest Covering ⋮ The coloring game on planar graphs with large girth, by a result on sparse cactuses ⋮ Decomposing a planar graph with girth at least 8 into a forest and a matching ⋮ Decomposition of sparse graphs, with application to game coloring number ⋮ On the small cycle transversal of planar graphs ⋮ Planar graphs decomposable into a forest and a matching ⋮ Covering planar graphs with forests, one having bounded maximum degree ⋮ Decomposing a graph into forests ⋮ Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
Cites Work
This page was built for publication: Decomposing a planar graph with girth 9 into a forest and a matching
