The incidence game chromatic number of paths and subgraphs of wheels

DOI10.1016/j.dam.2010.01.001zbMath1226.05118MaRDI QIDQ534326

John Y. Kim

Publication date: 17 May 2011

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

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

zbMATH Keywords

paths; game chromatic number; wheels; incidence coloring number; incidence game chromatic number

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

The graph distance game and some graph operations, The game chromatic index 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

Cites Work

• Unnamed Item
• A bound for the game chromatic number of graphs
• The game coloring number of planar graphs
• 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
• Refined activation strategy for the marking game
• 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
• Radius two trees specify χ‐bounded classes
• The Map-Coloring Game
• The incidence game chromatic number