منابع مشابه
The game chromatic index of wheels
We prove that the game chromatic index of n-wheels is n for n ≥ 6. © 2010 Elsevier B.V. All rights reserved.
متن کاملGame chromatic index of k-degenerate graphs
We consider the following edge coloring game on a graph G. Given t distinct colors, two players Alice and Bob, with Alice moving ®rst, alternately select an uncolored edge e of G and assign it a color different from the colors of edges adjacent to e. Bob wins if, at any stage of the game, there is an uncolored edge adjacent to colored edges in all t colors; otherwise Alice wins. Note that when ...
متن کاملThe chromatic Ramsey number of odd wheels
We prove that the chromatic Ramsey number of every odd wheel W2k+1, k ≥ 2 is 14. That is, for every odd wheel W2k+1, there exists a 14-chromatic graph F such that when the edges of F are two-coloured, there is a monochromatic copy of W2k+1 in F , and no graph F with chromatic number 13 has the same property. We ask whether a natural extension of odd wheels to the family of generalized Mycielski...
متن کاملThe Game Chromatic Index of Forests of Maximum Degree 5
Using a refinement of the methods of Erdös et al. [6] we prove that the game chromatic index of forests of maximum node degree 5 is at most 6. This improves the previously known upper bound 7 for this parameter. The bound 6 is tight [6].
متن کاملNote on the game chromatic index of trees
We study edge coloring games defining the so-called game chromatic index of a graph. It has been reported that the game chromatic index of trees with maximum degree ∆ = 3 is at most ∆ + 1. We show that the same holds true in case ∆ ≥ 6, which would leave only the cases ∆ = 4 and ∆ = 5 open.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.05.003