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

DOI10.1016/J.JDA.2014.10.001MaRDI QIDQ2018537zbMATHOpenAlexFDO

Authors Clément Charpentier, Éric 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

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

Recommendations

• The game chromatic and chromatic number of some graphs
• Game chromatic index of \(k\)-degenerate graphs
• scientific article; zbMATH DE number 398953
• A bound for the game chromatic number of graphs
• The incidence game chromatic number of paths and subgraphs of wheels
• Incidence Coloring Game and Arboricity of Graphs
• A note on the game chromatic index of graphs
• The game chromatic number of some join graphs
• scientific article; zbMATH DE number 5670857
• Game chromatic index of graphs with given restrictions on degrees

Cites work

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

Cited in

(6)

• Decomposing 4-connected planar triangulations into two trees and one path
• The incidence game chromatic number of paths and subgraphs of wheels
• The incidence game chromatic number
• On the game coloring index of \(F^+\)-decomposable graphs
• Indicated coloring game on Cartesian products of graphs
• Equality perfect graphs and digraphs

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

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