|
树和路的乘积图的广义染色数及博弈染色数
|
Abstract:
[1] | Kierstead, H.A. and Yang D. (2003) Orderings on Graphs and Game Coloring Number. Order,20, 255-264. https://doi.org/10.1023/B:ORDE.0000026489.93166.cb |
[2] | Bodlaender, H.L. (1991) On the Complexity of Some Coloring Games. In: M¨ohring, R.H., Eds., Graph-Theoretic Concepts in Computer Science. WG 1990. Lecture Notes in Computer Science, Springer, Berlin, 30-40. https://doi.org/10.1007/3-540-53832-1 29 |
[3] | Kierstead, H.A. (2005) Asymmetric Graph Coloring Games. Journal of Graph Theory, 48, 169-185. https://doi.org/10.1002/jgt.20049 |
[4] | Kierstead, H.A. and Yang, D. (2005) Very Asymmetric Marking Games. Order, 22, 93-107. https://doi.org/10.1007/s11083-005-9012-y |
[5] | Yang, D. and Zhu, X. (2008) Activation Strategy for Asymmetric Marking Games. European Journal of Combinatorics, 29, 1123-1132. https://doi.org/10.1016/j.ejc.2007.07.004 |