| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428395 | Information Processing Letters | 2007 | 5 Pages |
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(C)=colg(C)=5 for family of cactuses C.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
