#### Filter Results:

- Full text PDF available (1)

#### Publication Year

2009

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (3)

#### Publication Type

#### Journals and Conferences

#### Key Phrases

Learn More

- Tom Rackham
- Electr. J. Comb.
- 2009

Let G be a simple graph of maximum degree ∆ > 3, not containing K∆+1, and L a list assignment to V (G) such that |L(v)| = ∆ for all v ∈ V (G). Given a set P ⊂ V (G) of pairwise distance at least d then Albertson, Kostochka and West (2004) and Axenovich (2003) have shown that every L-precolouring of P extends to a L-colouring of G provided d > 8. Let K− ∆+1… (More)

- Tom Rackham
- Journal of Graph Theory
- 2011

- Tom Rackham
- Inf. Process. Lett.
- 2010

- ‹
- 1
- ›