International Journal of Pure and Applied Mathematics 2013 87: 855-862. Acyclic edge-coloring of Sierpinski-like graphs. On some metric properties of the Sierpinski graphs S(n, k). Taiwanese Journal of Mathematics 2008 12: 513-522. Coloring Sierpinski graphs and Sierpinski gasket graphs. Czechoslovak Mathematical Journal 1997 47: 95-104. Graphs S(n, k) and a variant of the Tower of Hanoi problem.
KROMATIK RENK SERIES
Journal of Combinatorial Theory Series B 2000 78: 57-68. A simple competitive graph coloring algorithm. Planar graph coloring with an uncooperative partner. Vertex-, edge-, and total-colorings of Sierpinski-like graphs. Game chromatic number of outerplanar graphs. On the game chromatic number of some classes of graphs. Faigle U, Kern U, Kierstead H A, Trotter W T.A bound for the game chromatic number of graphs. International Journal of Foundations of Computer Science 1991 2: 133-147. On the complexity of some coloring games. 2016 4(2): 91 - 98.ĪKCAN U, AKYAR E, AKYAR H "SIERPINSKI ÇİZGELERİN OYUN KROMATİK VE OYUN RENK SAYILARI." Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :B-Teorik Bilimler, 4, ss.91 - 98, 2016. Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :B-Teorik Bilimler. Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :B-Teorik Bilimler, vol.4, no.2, 2016, ss.91 - 98.ĪKCAN U, AKYAR E, AKYAR H SIERPINSKI ÇİZGELERİN OYUN KROMATİK VE OYUN RENK SAYILARI. Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :B-Teorik Bilimler 4, no.2 (2016): 91 - 98.ĪKCAN Ummahan, AKYAR EMRAH, AKYAR HANDAN SIERPINSKI ÇİZGELERİN OYUN KROMATİK VE OYUN RENK SAYILARI. Anadolu Üniversitesi Bilim ve Teknoloji Dergisi :B-Teorik Bilimler, 4(2), 91 - 98.ĪKCAN Ummahan,AKYAR EMRAH,AKYAR HANDAN SIERPINSKI ÇİZGELERİN OYUN KROMATİK VE OYUN RENK SAYILARI. SIERPINSKI ÇİZGELERİN OYUN KROMATİK VE OYUN RENK SAYILARI. Journal of Combinatorial Theory Series B 2008 98: 1-18.ĪKCAN U, AKYAR E, AKYAR H (2016). Refined activation strategy for the marking game.
The game coloring number of planar graphs Journal of Combinatorial Theory Series B 75: 245-258. Lower bounds for the game colouring number of partial -trees and planar graphs Discrete Mathematics 2008 308: 2637-2642. The game chromatic number and the game colouring number of cactuses. Information Processing Letters 2009 : 1183-1186.
0 kommentar(er)
