![]() (6) Both of these pitch standards define what are called ├ö├ç├┐equal tempered chromatic scales.├ö├ç├û (7) Perhaps the most solemn instrument is a full set of 65 chromatic bronze bells that date back 2,500 years. (5) When the holes are placed at proportioned intervals, a simple chromatic scale can be produced. (4) In the experiments described in the last two sections, we purposely made achromatic intensity unreliable, to prove that moths used the chromatic aspect of colour. ![]() (3) Whitney also wrote on graph theory, in particular the colouring of graphs and chromatic polynomials. (2) This fusion occurs only when the chromatic dots are too small to be resolved by the eye, or when they are viewed at sufficient distance. ![]() 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.(1) On the other side his use of colour is very far from the traditional concept of harmony: the chromatic juxtapositions are often daring, or they are previously decided following laws fixed by the artist. 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. 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. ![]() 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.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |