𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Marking Games and the Oriented Game Chromatic Number of Partialk-Trees

✍ Scribed by H.A. Kierstead; Zs. Tuza

Publisher
Springer Japan
Year
2003
Tongue
English
Weight
118 KB
Volume
19
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The relaxed game chromatic number of out
The relaxed game chromatic number of outerplanar graphs
✍ Charles Dunn; Hal A. Kierstead πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 92 KB

## Abstract The (__r__,__d__)‐relaxed coloring game is played by two players, Alice and Bob, on a graph __G__ with a set of __r__ colors. The players take turns coloring uncolored vertices with legal colors. A color Ξ± is legal for an uncolored vertex __u__ if __u__ is adjacent to at most __d__ vert

A bound for the game chromatic number of
A bound for the game chromatic number of graphs
✍ Thomas Dinski; Xuding Zhu πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 580 KB

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 particula

The chromatic number of oriented graphs
The chromatic number of oriented graphs
✍ Sopena, Eric πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 198 KB πŸ‘ 2 views

We introduce in this paper the notion of the chromatic number of an oriented graph G (that is of an antisymmetric directed graph) defined as the minimum order of an oriented graph H such that G admits a homomorphism to H. We study the chromatic number of oriented k-trees and of oriented graphs with

Finite fields and the 1-chromatic number
Finite fields and the 1-chromatic number of orientable surfaces
✍ Vladimir P. Korzhik πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 98 KB

## Abstract The 1‐chromatic number Ο‡~1~(__S__~__p__~) of the orientable surface __S__~__p__~ of genus __p__ is the maximum chromatic number of all graphs which can be drawn on the surface so that each edge is crossed by no more than one other edge. We show that if there exists a finite field of ord