63 search results - page 3 / 13 » Distance graphs with maximum chromatic number |
IWOCA
2009
Springer
14 years 24 days 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...
SIAMDM
2008
13 years 6 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
ICALP
2007
Springer
14 years 12 days ago
2007
Springer
In this paper we consider the classical Erd˝os-R´enyi model of random graphs Gn,p. We show that for p = p(n) ≤ n−3/4−δ , for any fixed δ > 0, the chromatic number χ...
JGT
2007
13 years 6 months ago
2007
A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...
DM
2008
13 years 6 months ago
2008
For any graph G, the k-improper chromatic number k (G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree ...