Browse by Person
Up a level |
Number of items: 1.
Chor, B. and Fellows, M.R. and Ragan, M.A. and Razgon, Igor and Rosamond, F.A. and Snir, S. (2007) Connected coloring completion for general graphs: algorithms and complexity. In: Snir, G. (ed.) COCOON 2007: Computing and Combinatorics. Lecture Notes in Computer Science 4598. Springer, pp. 75-85. ISBN 9783540735441.