The incidence game chromatic number

DOI10.1016/j.dam.2007.10.021zbMath1169.05321OpenAlexW2110523058MaRDI QIDQ5902114

Stephan Dominique Andres

Publication date: 24 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2007.10.021

zbMATH Keywords

cyclewheelstar\(k\)-degenerate graphincidence coloring numberincidence game chromatic numbergame chromatic index

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15)

Related Items

Hypergraph incidence coloring, The complexity of two colouring games, Defective incidence coloring of graphs, The game chromatic index of wheels, Indicated coloring game on Cartesian products of graphs, The incidence game chromatic number of paths and subgraphs of wheels, Erratum to [``The incidence game chromatic number, Discrete Appl. Math. 157, No.\,9, 1980--1987 (2009; Zbl 1169.05321)], The incidence game chromatic number of \((a,d)\)-decomposable graphs, On game chromatic vertex-critical graphs

Cites Work

• Unnamed Item
• Incidence and strong edge colorings of graphs
• On incidence coloring and star arboricity of graphs
• A simple competitive graph coloring algorithm
• The incidence coloring conjecture for graphs of maximum degree 3
• The incidence coloring numbers of meshes
• Incidence coloring of \(k\)-degenerated graphs
• The incidence coloring number of Halin graphs and outerplanar graphs
• Note on the game chromatic index of trees
• Refined activation strategy for the marking game
• The game chromatic index of forests of maximum degree \(\Delta \geqslant 5\)
• The incidence chromatic number of some graph
• Game chromatic index ofk-degenerate graphs
• ON THE COMPLEXITY OF SOME COLORING GAMES
• Game chromatic number of outerplanar graphs