Decomposition of sparse graphs, with application to game coloring number

DOI10.1016/J.DISC.2010.01.008MaRDI QIDQ968426zbMATH OpenOpenAlexFDO

Authors Mickaël Montassier, Arnaud Pêcher, Douglas B. West, Xuding Zhu, André 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

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

Recommendations

• Decomposition of sparse graphs into two forests, one having bounded maximum degree
• \(k\)-forested coloring of sparse graphs
• On the game coloring index of \(F^+\)-decomposable graphs
• Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\)
• Acyclic edge-colorings of sparse graphs

Cites work

• scientific article; zbMATH DE number 398953 (Why is no real title available?)
• Covering planar graphs with forests
• Covering planar graphs with forests, one having bounded maximum degree
• Decomposing a planar graph with girth 9 into a forest and a matching
• Decomposition of Finite Graphs Into Forests
• Edge-partitions of planar graphs and their game coloring numbers
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Refined activation strategy for the marking game
• The game coloring number of planar graphs

Cited in

(12)

• Decomposing 4-connected planar triangulations into two trees and one path
• Decomposing a graph into pseudoforests with one having bounded degree
• scientific article; zbMATH DE number 6297711 (Why is no real title available?)
• Decomposing a graph into forests
• 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
• Degree bounded forest covering
• On the game coloring index of \(F^+\)-decomposable graphs
• Decomposing a graph into forests and a matching
• Decomposition of sparse graphs into forests and a graph with bounded degree
• Sparse hypergraphs and pebble game algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968426)