Partitioning a Planar Graph of Girth 10 into a Forest and a Matching

DOI10.1111/j.1467-9590.2009.00468.xzbMath1209.05062OpenAlexW2064930463WikidataQ60060264 ScholiaQ60060264MaRDI QIDQ3553247

No author found.

Publication date: 22 April 2010

Published in: Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1467-9590.2009.00468.x

zbMATH Keywords

girthplanar graphedge partitionforest matching

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 (6)

Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph ⋮ 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 ⋮ Planar graphs decomposable into a forest and a matching ⋮ Covering planar graphs with forests, one having bounded maximum degree ⋮ 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
• Minimax degrees of quasiplanar graphs with no short cycles other than triangles
• Minimax degrees of quasiplane graphs without 4-faces
• Edge-partitions of planar graphs and their game coloring numbers

This page was built for publication: Partitioning a Planar Graph of Girth 10 into a Forest and a Matching