Tom Rackham

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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)
  • 1