The complexity of changing colourings with bounded maximum degree

Authors:
Tom Rackham
Affiliations:
Mathematical Institute, University of Oxford, OX1 3LB, UK
Venue:
Information Processing Letters
Year:
2010

Citing 5
Cited 0

Precoloring extension. I: Interval graphs

Discrete Mathematics - Special volume (part 1) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs”
The four-colour theorem

Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
Colouring graphs when the number of colours is nearly the maximum degree

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth

Combinatorics, Probability and Computing
Precoloring Extensions of Brooks' Theorem

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

Let G be a graph, x,y@?V(G), and @f:V(G)-[k] a k-colouring of G such that @f(x)=@f(y). If @D(G)=k+@?k@?-1 then the following question is NP-complete: Does there exist a k-colouring @f^' of G such that @f^'(x)@f^'(y)? Conversely, if @D(G)=