Planar graphs decomposable into a forest and a matching

DOI10.1016/j.disc.2007.12.104zbMath1221.05070OpenAlexW2042358515WikidataQ60060263 ScholiaQ60060263MaRDI QIDQ998522

Anna O. Ivanova, Naeem N. Sheikh, Oleg V. Borodin, Alexandr V. Kostochka

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.104

zbMATH Keywords

planar graphsgraph decompositionsedge decompositions

Mathematics Subject Classification ID

Paths and cycles (05C38) 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 (4)

Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) ⋮ The coloring game on planar graphs with large girth, by a result on sparse cactuses ⋮ Triangle decompositions of planar graphs ⋮ 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
• Partitioning a Planar Graph of Girth 10 into a Forest and a Matching
• Edge-partitions of planar graphs and their game coloring numbers

This page was built for publication: Planar graphs decomposable into a forest and a matching