The incidence game chromatic number of paths and subgraphs of wheels

Authors:
John Y. Kim
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
2011

Citing 12
Cited 1

Incidence and strong edge colorings of graphs

Discrete Mathematics
Planar graph coloring with an uncooperative partner

Journal of Graph Theory
On incidence coloring and star arboricity of graphs

Discrete Mathematics
A bound for the game chromatic number of graphs

Discrete Mathematics
The game coloring number of planar graphs

Journal of Combinatorial Theory Series B
A simple competitive graph coloring algorithm

Journal of Combinatorial Theory Series B
The incidence coloring number of Halin graphs and outerplanar graphs

Discrete Mathematics
Refined activation strategy for the marking game

Journal of Combinatorial Theory Series B
Game chromatic number of outerplanar graphs

Journal of Graph Theory
Game chromatic index of k-degenerate graphs

Journal of Graph Theory
The incidence game chromatic number

Discrete Applied Mathematics
The incidence coloring numbers of meshes

Computers & Mathematics with Applications

Domination Game and an Imagination Strategy

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

The incidence game chromatic number was introduced to unify the ideas of the incidence coloring number and the game chromatic number. We determine the exact incidence game chromatic number of large paths and give a correct proof of a result stated by Andres [S.D. Andres, The incidence game chromatic number, Discrete Appl. Math. 157 (2009) 1980-1987] concerning the exact incidence game chromatic number of large wheels.