Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference21 articles.
1. H. Bodlaender, On the complexity of some coloring games, in: R. Möhring, (Ed.), Graph Theoretical Concepts in Computer Science, vol. 484, Lecture Notes in Computer Science, Springer, Berlin, 1991, pp. 30–40.
2. Game chromatic index of k-degenerate graphs;Cai;J. Graph Theory,2001
3. Relaxed game chromatic number of graphs;Chou;Discrete Math.,2003
4. Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency;Cowen;J. Graph Theory,1986
5. Defective coloring revisited;Cowen;J. Graph Theory,1997
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献