1. C.J. Colbourn, R. Grossi, and N. Pisanti (editors), Combinatorial Algorithms, Springer, 2019.
  2. C.J. Colbourn (editor), Algebraic Design Theory and Hadamard Matrices, Springer, 2015. ISBN 9783319177281.
  3. C.J. Colbourn and J.H. Dinitz, Handbook of Combinatorial Designs, Second Edition, Chapman and Hall/CRC, 2007. ISBN-13 978-1584885061.
  4. Charles J. Colbourn and Alexander Rosa, Triple Systems, Oxford University Press, March 1999. ISBN 0 19 853576 7.
  5. C.J. Colbourn and J.H. Dinitz, CRC Handbook of Combinatorial Designs, CRC Press, 1996. ISBN: 0-8493-8948-8
  6. C.J. Colbourn and E.S. Mahmoodian (editors), Combinatorics Advances, Kluwer Academic, 1995, ISBN 0-7923-3574-0. The table of contents is available here.
  7. D.D. Harms, M. Kraetzl, C.J. Colbourn, and J.S. Devitt, Network Reliability: Experiments with a Symbolic Algebra Environment, CRC Press, Boca Raton FL, 1995. ISBN 0-8493-3980-4.
  8. C.J. Colbourn, D. Jungnickel and A. Rosa (editors), Designs and Graphs, special volume of Discrete Mathematics, 97 (1991); also Topics in Discrete Mathematics 4 (1991).
  9. C.J. Colbourn, The Combinatorics of Network Reliability, Oxford University Press, 1987. ISBN 0-19-504920-9.
  10. C.J. Colbourn and R.A. Mathon (editors), Combinatorial Design Theory, Annals of Discrete Mathematics, North-Holland, volume 34, 1987.
  11. C.J. Colbourn and M.J. Colbourn (editors), Algorithms in Combinatorial Design Theory, Annals of Discrete Mathematics, volume 26, North-Holland, 1985.