Coding with Graphs graph theory in code






  1. Henderson, M. (2013). On the Completability of Wing-Form Partial Latin Squares.
  2. Davis, S., Henderson, M., & Smith, A. (2010). Modeling Sudoku Puzzles with Python. In J. M. Stéfan van der Walt (Ed.), Proceedings of the 9th Python in Science Conference (SciPy 2010) (Vol. 7, p. 3). Retrieved from
  3. Henderson, M. (2012). Some Observations on the Intricacy of Partial Latin Square Completion.
  4. Henderson, M. (2012). On the Completability of Kite-Form Partial Latin Squares.
  5. Henderson, M. (2011). Constraint Modelling of Pandiagonal Strongly-Symmetric Self-Orthogonal Diagonal Latin Squares.
  6. Henderson, M. (2011). A Brief Introduction to Goldberg’s Conjecture.
  7. (missing reference)
  8. Henderson, P., & Henderson, M. J. (2009). Consistency Checking for Component Reuse in Open Systems. In S. H. Edwards & G. Kulczycki (Eds.), ICSR (Vol. 5791, pp. 1–10). Springer. Retrieved from
  9. Henderson, P., & Henderson, M. J. (2009). Collaborative Development of System Architecture - a Tool for Coping with Inconsistency. In SEKE (pp. 520–525). Knowledge Systems Institute Graduate School. Retrieved from
  10. Henderson, M., Shawe-Taylor, J., & Žerovnik, J. (2005). Mixture of Vector Experts. In S. Jain, H. U. Simon, & E. Tomita (Eds.), Algorithmic Learning Theory (Vol. 3734, pp. 386–398). Springer Berlin Heidelberg. doi:10.1007/11564089_30
  11. Henderson, M. J., & Hilton, A. J. W. (2004). Completing an Edge-Colouring of K2m with Kr and Independent Edges Precoloured. Journal Of the London Mathematical Society, 70(3), 545–566. Retrieved from
  12. Henderson, M. J. (2005). Embedding Symmetric Latin Squares and Edge-Coloured Graphs (PhD thesis). University of Reading.