Name
Abstract | ||
|---|---|---|
Let $G$ be a finite graph with maximum degree at most $d$. Then, for every partition of $V(G)$ into classes of size $3d-1$, there exists a proper colouring of $G$ with $3d-1$ colours in which each class receives all $3d-1$ colours. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1017/S0963548304006157 | Combinatorics, Probability & Computing |
Keywords | Field | DocType |
proper colouring,maximum degree,strong chromatic number,finite graph | Discrete mathematics,Graph,Combinatorics,Chromatic scale,Existential quantification,Degree (graph theory),Partition (number theory),Mathematics | Journal |
Volume | Issue | ISSN |
13 | 6 | 0963-5483 |
Citations | PageRank | References |
10 | 0.87 | 2 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. E. Haxell | 1 | 212 | 26.40 |