The game chromatic number and the game colouring number of cactuses

Authors:
Elżbieta Sidorowicz
Affiliations:
Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Góra, Szafrana 4a, 65-516 Zielona Góra, Poland
Venue:
Information Processing Letters
Year:
2007

Citing 5
Cited 2

Graphs & digraphs (2nd ed.)

Graphs & digraphs (2nd ed.)
The game coloring number of planar graphs

Journal of Combinatorial Theory Series B
GO Is Polynomial-Space Hard

Journal of the ACM (JACM)
The game coloring number of pseudo partial k-trees

Discrete Mathematics
Game chromatic number of outerplanar graphs

Journal of Graph Theory

Game chromatic number of graphs with locally bounded number of cycles

Information Processing Letters
The game chromatic number and the game colouring number of classes of oriented cactuses

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider the colouring game and the marking game. A graph G is a cactus if any two cycles of G have at most one common vertex. We prove that @g"g(C)=col"g(C)=5 for family of cactuses C.