Planar graphs decomposable into a forest and a matching

DOI10.1016/J.DISC.2007.12.104zbMATH Open1221.05070OpenAlexW2042358515WikidataQ60060263 ScholiaQ60060263MaRDI QIDQ998522FDOQ998522

Anna O. Ivanova, Naeem N. Sheikh, Oleg V. Borodin, Alexandr 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

Recommendations

• Decomposing a planar graph with girth 9 into a forest and a matching
• Decomposing a planar graph with girth at least 8 into a forest and a matching
• Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
• Partitioning a planar graph of girth 10 into a forest and a matching
• Decomposing a graph into forests

zbMATH Keywords

planar graphsgraph decompositionsedge decompositions

Mathematics Subject Classification ID

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

Cites Work

• Partitioning a Planar Graph of Girth 10 into a Forest and a Matching
• Edge-partitions of planar graphs and their game coloring numbers
• Decomposing a planar graph with girth 9 into a forest and a matching

Cited In (6)

• Decomposition of sparse graphs into forests and a graph with bounded degree
• Triangle decompositions of planar graphs
• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
• Decomposing a planar graph with girth at least 8 into a forest and a matching
• Decomposing a planar graph with girth 9 into a forest and a matching
• The coloring game on planar graphs with large girth, by a result on sparse cactuses

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

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