SIERPINSKI ÇİZGELERİN OYUN KROMATİK VE OYUN RENK SAYILARI
Öz
Anahtar Kelimeler
Kaynakça
- Bodlaender H L. On the complexity of some coloring games. International Journal of Foundations of Computer Science 1991; 2: 133-147.
- Dinski T, Zhu X. A bound for the game chromatic number of graphs. Discrete Mathematics 1999; : 109-115.
- Faigle U, Kern U, Kierstead H A, Trotter W T. On the game chromatic number of some classes of graphs. Ars Combinatoria 1993; 35: 143-150.
- Gardner M. Mathematical Games. Scientific American 1981; 23.
- Guan D J, Zhu X. Game chromatic number of outerplanar graphs. Journal of Graph Theory 1999; : 67-70.
- Hinz A M, Parisse D. Coloring Hanoi and Sierpinski graphs. Discrete Mathematics 2012; 312: 1521
- Jakovac M, Klavžar S. Vertex-, edge-, and total-colorings of Sierpinski-like graphs. Discrete Mathematics 2009; 309: 1548-1556.
- Kierstead H A., Trotter W T. Planar graph coloring with an uncooperative partner. Journal of Graph Theory 1994; 18: 569-584.
- Kierstead H A. A simple competitive graph coloring algorithm. Journal of Combinatorial Theory Series B 2000; 78: 57-68.
- Kierstead H A., Yang D. Very asymmetric marking games. Order 2005; 22: 93-107.