Partitioning a planar graph of girth 10 into a forest and a matching

DOI10.1111/J.1467-9590.2009.00468.XzbMATH Open1209.05062OpenAlexW2064930463WikidataQ60060264 ScholiaQ60060264MaRDI QIDQ3553247FDOQ3553247

Authors:

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

Recommendations

• Decomposing a planar graph with girth 9 into a forest and a matching
• Partition of a planar graph with girth 6 into two forests with chain length at most 4
• Partition of a planar graph with girth 7 into two star forests
• Planar graphs decomposable into a forest and a matching
• Decomposing a planar graph with girth at least 8 into a forest and a matching

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)

Cites Work

• Minimax degrees of quasiplanar graphs with no short cycles other than triangles
• Edge-partitions of planar graphs and their game coloring numbers
• Decomposing a planar graph with girth 9 into a forest and a matching
• Minimax degrees of quasiplane graphs without 4-faces

Cited In (11)

• Partition of a planar graph with girth 7 into two star forests
• Partitioning edges of a planar graph into linear forests and a matching
• Decomposition of sparse graphs into forests and a graph with bounded degree
• 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\)
• Covering planar graphs with forests, one having bounded maximum degree
• 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
• Planar graphs decomposable into a forest and a matching
• The coloring game on planar graphs with large girth, by a result on sparse cactuses
• Partition of a planar graph with girth 6 into two forests with chain length at most 4

This page was built for publication: Partitioning a planar graph of girth 10 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 Q3553247)