Author:
Nakprasit Keaitsuda Maneeruk,Nakprasit Kittikorn
Funder
the Commission on Higher Education and the Thailand Research Fund
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference15 articles.
1. Bodlaender, H.L.: On the complexity of some colouring games. J. Found. Comput. Sci. 2, 133–147 (1991)
2. Borodin, O.V., Ivanova, A.O., Kostochka, A.V., Sheikh, N.N.: Decomposing of quadrangle-free planar graphs. Discuss. Math. Graph Theory 29, 87–99 (2009)
3. Faigle, U., Kern, U., Kierstead, H.A., Trotter, W.T.: The game chromatic number of some classes of graphs graphs. Ars Comb. 35, 143–150 (1993)
4. Guan, D., Zhu, X.: The game chromatic number of outerplanar graphs. J. Graph Theory 30, 67–70 (1999)
5. He, W., Hou, X., Lih, K., Shao, J., Wang, W., Zhu, X.: Edge-partitions of planar graphs and their game coloring numbers. J. Graph Theory 41, 307–317 (2002)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献