aubtd-b

Anadolu Üniversitesi Bilim Ve Teknoloji Dergisi - B Teorik Bilimler

2146-0272 2146-0191

Eskişehir Teknik Üniversitesi

10.20290/btdb.53177

SIERPINSKI ÇİZGELERİN OYUN KROMATİK VE OYUN RENK SAYILARI

Akcan

Ummahan

Akyar

Emrah

Akyar

Handan

08 25 2016

4 2 91 98 02 15 2016

2010

Anadolu Üniversitesi Bilim Ve Teknoloji Dergisi - B Teorik Bilimler

Bu çalışmada, n>=1 ve k>=2 iken S(n,k) Sierpinski çizgelerinin oyun renk sayısı ve özel olarak k=3 için S(n,k) Sierpinski çizgelerinin oyun kromatik sayısı hesaplanmıştır. Ayrıca Sierpinski çizgeler ile ilgili bazı açık problemlerden de bahsedilmiştir.

Sierpinski çizge Oyun kromatik sayısı Oyun renk sayısı

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, Klavž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.

Klavžar S, Milutinović U. Graphs S(n, k) and a variant of the Tower of Hanoi problem. Czechoslovak Mathematical Journal 1997; 47: 95-104.

Klavžar S. Coloring Sierpinski graphs and Sierpinski gasket graphs. Taiwanese Journal of Mathematics 2008; 12: 513-522.

Parisse D. On some metric properties of the Sierpinski graphs S(n, k). Ars Combinatoria 2009; 90: 160.

Paul D, Rajasingh I. Acyclic edge-coloring of Sierpinski-like graphs. International Journal of Pure and Applied Mathematics 2013; 87: 855-862.

Raspaud A, Wu J. Game chromatic number of toroidal grids. Information Processing Letters 2009; : 1183-1186.

Sidorowicz E. The game chromatic number and the game colouring number of cactuses. Information Processing Letters 2007; 102: 147-151.

Wu J, Zhu X. Lower bounds for the game colouring number of partial -trees and planar graphs Discrete Mathematics 2008; 308: 2637-2642.

Zhu X. The game coloring number of planar graphs Journal of Combinatorial Theory Series B ; 75: 245-258. Zhu X. Refined activation strategy for the marking game. Journal of Combinatorial Theory Series B 2008; 98: 1-18.