33 search results - page 2 / 7 » Game chromatic number of Cartesian product graphs |
SIAMDM
2010
13 years 3 months ago
2010
GC
2008
Springer
13 years 5 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
COCOON
2006
Springer
13 years 8 months ago
2006
Springer
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...
SIAMDM
2008
13 years 4 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
ENDM
2006
13 years 4 months ago
2006
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...