The incidence game chromatic number of \((a,d)\)-decomposable graphs

DOI10.1016/j.jda.2014.10.001zbMath1325.05074OpenAlexW1978265445MaRDI QIDQ2018537

Clément Charpentier, Eric Sopena

Publication date: 24 March 2015

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2014.10.001

zbMATH Keywords

arboricityincidence coloringincidence game chromatic number\((a,d)\)-decomposable graphsincidence coloring game

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (4)

Decomposing 4-connected planar triangulations into two trees and one path ⋮ Unnamed Item ⋮ On the game coloring index of \(F^+\)-decomposable graphs ⋮ Indicated coloring game on Cartesian products of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The incidence game chromatic number of paths and subgraphs of wheels
• Decomposing a graph into forests
• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
• Covering planar graphs with forests, one having bounded maximum degree
• Lightness of digraphs in surfaces and directed game chromatic number
• A bound for the game chromatic number of graphs
• The game coloring number of planar graphs
• Incidence and strong edge colorings of graphs
• A simple competitive graph coloring algorithm
• The incidence coloring conjecture for graphs of maximum degree 3
• Incidence coloring of \(k\)-degenerated graphs
• The incidence coloring number of Halin graphs and outerplanar graphs
• Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
• Refined activation strategy for the marking game
• Incidence Coloring Game and Arboricity of Graphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs
• Radius two trees specify χ‐bounded classes
• Edge-partitions of planar graphs and their game coloring numbers
• Decompositions of quadrangle-free planar graphs
• The Map-Coloring Game
• Decomposition of Finite Graphs Into Forests
• Game chromatic number of toroidal grids
• The incidence game chromatic number

This page was built for publication: The incidence game chromatic number of \((a,d)\)-decomposable graphs