Decomposition of sparse graphs, with application to game coloring number

DOI10.1016/j.disc.2010.01.008zbMath1219.05145OpenAlexW2150898108MaRDI QIDQ968426

Mickaël Montassier, Arnaud Pêcher, Douglas B. West, Xuding Zhu, Andre Raspaud

Publication date: 5 May 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

forestgame coloring numbersubgraphs with bounded maximum degreeedge-partition

Mathematics Subject Classification ID

Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

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\) ⋮ Game chromatic number of graphs with locally bounded number of cycles ⋮ Decomposition of sparse graphs into two forests, one having bounded maximum degree ⋮ Decomposing a graph into pseudoforests with one having bounded degree ⋮ Degree Bounded Forest Covering ⋮ Decomposing a graph into forests and a matching ⋮ Decomposing a graph into forests ⋮ Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree

Cites Work

• Unnamed Item
• Decomposing a planar graph with girth 9 into a forest and a matching
• Covering planar graphs with forests, one having bounded maximum degree
• The game coloring number of planar graphs
• Covering planar graphs with forests
• Refined activation strategy for the marking game
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Edge-partitions of planar graphs and their game coloring numbers
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Decomposition of sparse graphs, with application to game coloring number