284 search results - page 4 / 57 » On the adaptable chromatic number of graphs |
GC
2008
Springer
13 years 6 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...
JGT
2006
13 years 6 months ago
2006
Following [1], we investigate the problem of covering a graph G with induced subgraphs G1, . . . , Gk of possibly smaller chromatic number, but such that for every vertex u of G, ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
ENDM
2007
13 years 6 months ago
2007
We find exact values for the game chromatic number of the Cartesian product graphs Sm Pn, Sm Cn, P2 Wn, and P2 Km,n. This extends previous results of Bartnicki et al. on the game...
COMBINATORICA
1998
13 years 6 months ago
1998
We prove that the total chromatic number of any graph with maximum degree is at most plus an absolute constant. In particular, we show that for su ciently large, the total chromat...