751 search results - page 5 / 151 » The Distinguishing Chromatic Number |
JGT
2006
13 years 7 months ago
2006
This paper studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs have
CORR
2010
Springer
13 years 7 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
RSA
1998
13 years 7 months ago
1998
: For a pair of integers 1F␥-r, the ␥-chromatic number of an r-uniform Ž .hypergraph Hs V, E is the minimal k, for which there exists a partition of V into subsets < <T ...
IWOCA
2009
Springer
14 years 1 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
ENDM
2007
13 years 7 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...