On the Oriented Game Chromatic Number
نویسندگان
چکیده
We consider the oriented version of a coloring game introduced by Bodlaender [On the complexity of some coloring games, Internat. J. Found. Comput. Sci. 2 (1991), 133–147]. We prove that every oriented path has oriented game chromatic number at most 7 (and this bound is tight), that every oriented tree has oriented game chromatic number at most 19 and that there exists a constant t such that every oriented outerplanar graph has oriented game chromatic number at most t.
منابع مشابه
Competitive Colorings of Oriented Graphs
Nešeťril and Sopena introduced a concept of oriented game chromatic number and developed a general technique for bounding this parameter. In this paper, we combine their technique with concepts introduced by several authors in a series of papers on game chromatic number to show that for every positive integer k, there exists an integer t so that if C is a topologically closed class of graphs an...
متن کاملRanking Efficient Decision Making Units Using Cooperative Game Theory Based on SBM Input-Oriented Model and Nucleolus Value
In evaluating the efficiency of decision making units (DMUs) by Data Envelopment Analysis (DEA) models, may be more than one DMU has an efficiency score equal to one. Since ranking of efficient DMUs is essential for decision makers, therefore, methods and models for this purpose are presented. One of ranking methods of efficient DMUs is cooperative game theory. In this study, Lee and Lozano mod...
متن کاملGame chromatic number of graphs
y Abstract We show that if a graph has acyclic chromatic number k, then its game chromatic number is at most k(k + 1). By applying the known upper bounds for the acyclic chromatic numbers of various classes of graphs, we obtain upper bounds for the game chromatic number of these classes of graphs. In particular, since a planar graph has acyclic chromatic number at most 5, we conclude that the g...
متن کاملThe incidence game chromatic number
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with maximum degree ∆, the upper bound 2∆ + 4k − 2 for the incidence game chromatic number is given. If ∆ ≥ 5k, we improve this bound to the value 2∆ + 3k − 1. We also determine the exact incidence game chromatic number of...
متن کاملThe Game Chromatic Number of 1-Caterpillars
The game chromatic number of a graph is defined using a two players game. In 1993, Faigle et al. proved that the game chromatic number of trees is at most four. In this paper we investigate the problem of characterizing those trees with game chromatic number three, and setttle this problem for 1-caterpillars.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 8 شماره
صفحات -
تاریخ انتشار 2001