1302 search results - page 3 / 261 » On the Strong Chromatic Number |
JGT
2010
13 years 3 months ago
2010
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose
ENDM
2006
13 years 5 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...
DM
1998
13 years 5 months ago
1998
Suppose G is a graph. The chromatic Ramsey number rc(G) of G is the least integer m such that there exists a graph F of chromatic number m for which the following is true: For any...
DM
2007
13 years 5 months ago
2007
—We give an inequality for the group chromatic number of a graph as an extension of Brooks’ Theorem. Moreover, we obtain a structural theorem for graphs satisfying the equality...
DAM
2007
13 years 5 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...