Abstract
We continue the study of the following general problem on the vertex colourings of graphs. Suppose that some vertices of a graphGare assigned to some colours. Can this ‘precolouring’ be extended to a proper colouring ofGwith at mostkcolours (for some givenk)? Here we investigate the complexity status of precolouring extendibility on some classes of perfect graphs, giving good characterizations (necessary and sufficient conditions) that lead to algorithms with linear or polynomial running time. It is also shown how a larger subclass of perfect graphs can be derived from graphs containing no induced path on four vertices.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Reference31 articles.
1. [24] König D. (1936) Theorie der Endlichen und Unendlichen Graphen (German). [Theory of finite and infinite graphs] Akademische Verlagsgeselschaft, Leipzig. [(1950) Reprinted Chelsea, New York
2. (1990) Translated into English by McCoart, M., Birkhäuser.]
3. Algorithmic complexity of list colorings
4. [5] Cook S. A. (1971) The complexity of theorem proving procedures. Proc. 3rd Annual ACM Symposium on Theory of Computing 151–158.
5. Blocking and anti-blocking pairs of polyhedra
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献