174 search results - page 5 / 35 » On the First-Fit Chromatic Number of Graphs |
92
Voted
JGT
2006
15 years 12 days 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, ...
87
Voted
CORR
2010
Springer
15 years 16 days 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
115
Voted
ENDM
2007
15 years 12 days 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...
106
Voted
COMBINATORICA
1998
15 years 4 days 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...
100
Voted
DM
2010
15 years 15 days ago
2010
A labeling of a graph G is distinguishing if it is only preserved by the trivial automorphism of G. The distinguishing chromatic number of G is the smallest integer k such that G ...