Decomposing a planar graph with girth at least 8 into a forest and a matching

DOI10.1016/J.DISC.2011.01.019MaRDI QIDQ534048zbMATHOpenAlexWikidataFDO

Authors Qijun Zhang, Yingqian Wang

Publication date 10 May 2011

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

matchinggirthplanar graphforestdecomposing

Mathematics Subject Classification ID

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

Recommendations

• Planar graphs decomposable into a forest and a matching
• Decomposing a planar graph with girth 9 into a forest and a matching
• Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
• Decomposing a graph into forests and a matching
• Partitioning a planar graph of girth 10 into a forest and a matching
• Decomposing a planar graph of girth 5 into an independent set and a forest
• Decomposition of some planar graphs into trees
• Partitioning edges of a planar graph into linear forests and a matching
• scientific article; zbMATH DE number 91047
• On the vertex partition of planar graphs into forests with bounded degree

Cites work

• Decomposing a planar graph with girth 9 into a forest and a matching
• Decomposition of sparse graphs into forests and a graph with bounded degree
• Edge-partitions of planar graphs and their game coloring numbers

Cited in

(19)

• Decomposing 4-connected planar triangulations into two trees and one path
• Towards obtaining a 3-decomposition from a perfect matching
• Decomposing plane cubic graphs
• Generalized arboricity of graphs with large girth
• Decomposing a graph into forests
• Thin trees in 8-edge-connected planar graphs
• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
• Decomposing a planar graph with girth 9 into a forest and a matching
• On the game coloring index of \(F^+\)-decomposable graphs
• Partitioning a planar graph of girth 10 into a forest and a matching
• Triangle decompositions of planar graphs
• Consecutive colouring of oriented graphs
• The game coloring number of planar graphs with a specific girth
• The game coloring number of planar graphs with a given girth
• Decomposition of sparse graphs into forests and a graph with bounded degree
• Planar graphs decomposable into a forest and a matching
• The coloring game on planar graphs with large girth, by a result on sparse cactuses
• Edge-partition and star chromatic index
• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph

This page was built for publication: Decomposing a planar graph with girth at least 8 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 Q534048)