174 search results - page 3 / 35 » On the First-Fit Chromatic Number of Graphs |
106
Voted
DM
2007
15 years 12 days 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...
120
Voted
DM
1998
15 years 3 days 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...
CMA
2010
14 years 10 months ago
2010
88
Voted
JGT
2006
15 years 12 days 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
110
Voted
DAM
2007
15 years 12 days 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...