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

DOI10.1016/j.disc.2011.01.019zbMath1223.05047OpenAlexW2070483072WikidataQ60060265 ScholiaQ60060265MaRDI QIDQ534048

Qijun Zhang, Ying Qian 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)

Related Items (16)

Decomposing 4-connected planar triangulations into two trees and one path ⋮ Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) ⋮ Decomposing plane cubic graphs ⋮ On the game coloring index of \(F^+\)-decomposable graphs ⋮ Thin trees in 8-edge-connected planar graphs ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ Generalized arboricity of graphs with large girth ⋮ The game coloring number of planar graphs with a specific girth ⋮ Consecutive colouring of oriented graphs ⋮ The coloring game on planar graphs with large girth, by a result on sparse cactuses ⋮ The game coloring number of planar graphs with a given girth ⋮ Triangle decompositions of planar graphs ⋮ Decomposing a graph into forests ⋮ Edge-partition and star chromatic index ⋮ Towards obtaining a 3-decomposition from a perfect matching ⋮ 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
• Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
• Edge-partitions of planar graphs and their game coloring numbers

This page was built for publication: Decomposing a planar graph with girth at least 8 into a forest and a matching