BIROn - Birkbeck Institutional Research Online
    Up a level
    Export as [feed] Atom [feed] RSS
    Jump to: 2007
    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.

    This list was generated on Fri Jul 12 06:17:16 2024 BST.