• Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel and Daniel Paulusma. On the diameter of reconfiguration graphs for vertex colourings.. Electronic Notes in Discrete Mathematics 38 (2011), 161-166. Preprint (pdf). doi.
  Extended abstract in: Proceedings of WG 2007. Lecture Notes in Computer Science 4769 (2007), 166-177. doi.
• Luis Cereceda, Jan van den Heuvel, and Matthew Johnson. Mixing 3-colourings in bipartite graphs. European Journal of Combinatorics 30 (2009), 1593-1606. Preprint (pdf). doi
  Extended abstract in: Proceedings of WG 2007. Lecture Notes in Computer Science 4769 (2007), 166-177. doi.
• Hajo Broersma, Matthew Johnson and Daniel Paulusma. Upper bounds and algorithms for parallel knock-out numbers. Theoretical Computer Science 410 (2009), 1319-1327. Preprint (pdf). doi.
  Extended abstract in: Proceedings of SIROCCO 2007. Lecture Notes in Computer Science 4474, 328-340. doi.
• Luis Cereceda, Jan van den Heuvel, and Matthew Johnson. Finding Paths Between 3-Colourings. J. Graph Theory, to appear.
  Extended abstract in: Proceedings of IWOCA 2008, 182-196. Preprint (pdf).
• Matthew Johnson, Daniel Paulusma and Chantal Wood. Path factors and parallel knock-out schemes of almost claw-free graphs. Proceedings of IWOCA 2008, 27-41. Preprint (pdf).
• Luis Cereceda, Jan van den Heuvel, and Matthew Johnson. Connectedness of the graph of vertex-colourings. Discrete Math. 308 (2008), 913-919. Preprint (pdf). doi.
• Jan van den Heuvel and Matthew Johnson. Transversals of subtree hypergraphs and the source location problem in digraphs. Networks 51 (2008) 113-119. Preprint (pdf) doi.
• Hajo Broersma, Matthew Johnson, Daniel Paulusma and Iain Stewart. The computational complexity of the parallel knock-out problem. Theoretical Computer Science 393 (2008), 182-195. Preprint (pdf). doi.
  Extended abstract in: Proceedings of LATIN 2006. Lecture Notes in Computer Science 3887, 250-261. doi.
• Paul Bonsma, Luis Cereceda, Jan van den Heuvel, and Matthew Johnson. Finding paths between graph colourings: computational complexity and possible distances. Electronic Notes in Discrete Mathematics 29 (2007), 463-469. doi.
• Matthew Johnson. Amalgamations of factorizations of complete graphs. J. Comb. Theory (B) 97 (2007), 597-611. Preprint (pdf). doi
• Anthony Hilton and Matthew Johnson. Cycle decompositions of the complete graph. Ars Combinatoria 81 (2007). Preprint (pdf).
• Jan van den Heuvel and Matthew Johnson. The External Network Problem. Lecture Notes in Computer Science 3405 (2005). Preprint (pdf). doi
• Anthony Hilton and Matthew Johnson. Amalgamations of factorizations of complete equipartite graphs. Discrete Math. 284 (2004), 60-77. Preprint (pdf). doi
• Changiz Eslahchi and Matthew Johnson. Characterization of graphs with Hall number 2. J. Graph Theory 45 (2003), 81-100. Preprint (pdf). doi
• Anthony Hilton and Matthew Johnson. An algorithm for finding factorizations of complete graphs. J. Graph Theory 43 (2003), 132-136. Preprint (pdf). doi
• Anthony Hilton, Matthew Johnson, Chris Rodger and Evan Wantland. Amalgamations of connected k-factorizations. J. Comb. Theory (B) 88 (2003), 267-279. Preprint (PostScript). doi
• David Bedford, Matthew Johnson, Matthew Ollis. Defining sets for Latin squares given that they are based on groups. European J. of Combinatorics 24 (2003), 129-135. Preprint (pdf). doi
• Anthony Hilton and Matthew Johnson. Some results on the Oberwolfach problem. J. London Math. Soc. 64 (2001), 513-522. Preprint (pdf). doi
• David Bedford and Matthew Johnson. Weak critical sets in cyclic Latin squares. Australas. J. Combin. 23 (2001), 301-316. Preprint (pdf).
• David Bedford and Matthew Johnson. Weak uniquely completable sets for finite groups. Bull. London Math. Soc. 32 (2000), 155-162. doi

• Iain Stewart, Daniel Paulusma and Matthew Johnson. Selected papers from the 4th Algorithms and Complexity in Durham Workshop, ACiD 2010. Held at Durham University, September 20-22, 2010. J. Discrete Algorithms, in press. doi
• Hajo Broersma, Stefan Dantchev, Matthew Johnson and Stefan Szeider. Selected papers from the 3rd Algorithms and Complexity in Durham Workshop, ACiD 2007. Held at Durham University, September 17-19, 2007. J. Discrete Algorithms 8 (2010). doi
• Hajo Broersma, Stefan Dantchev, Matthew Johnson and Stefan Szeider. Selected papers from the 2nd Algorithms and Complexity in Durham Workshop, ACiD 2006. Held at Durham University, September 18-20, 2006. J. Discrete Algorithms 7 (2009). doi
• Hajo Broersma, Stefan Dantchev, Matthew Johnson and Stefan Szeider. Selected papers from the 2nd Algorithms and Complexity in Durham Workshop, ACiD 2006. Held at Durham University, July 8-10, 2005. J. Discrete Algorithms 6 (2008). doi
• Hajo Broersma, Stefan Dantchev, Matthew Johnson and Stefan Szeider. Algorithms and Complexity in Durham 2007, Proceedings of the Third ACiD Workshop. Texts in Algorithmics 9, College Publications, London, 2007.
• Hajo Broersma, Stefan Dantchev, Matthew Johnson and Stefan Szeider. Algorithms and Complexity in Durham 2006, Proceedings of the Second ACiD Workshop. Texts in Algorithmics 7, College Publications, London, 2006.
• Hajo Broersma, Stefan Dantchev, Matthew Johnson and Stefan Szeider. Algorithms and Complexity in Durham 2005, Proceedings of the First ACiD Workshop. Texts in Algorithmics 4, College Publications, London, 2005.

Last change: 24 March 2010.