Items where Author is "Johnson, Matthew"

Number of items: 11.
  • Connectedness of the graph of vertex-colourings. Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
  • Connectedness of the graph of vortex-colourings. Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
  • Defining sets for Latin squares given that they are based on groups. Bedford, David; Johnson, Matthew; Ollis, M. A.
  • Finding paths between 3-colorings. Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
  • Mixing 3-colourings in bipartite graphs. Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew
  • Some results on the Oberwolfach problem. Hilton, A. J. W.; Johnson, Matthew
  • Transversals of subtree hypergraphs and the source location problem in digraphs. van den Heuvel, Jan; Johnson, Matthew
  • Transversals of subtree hypergraphs and the source location problem in digraphs. van den Heuvel, Jan; Johnson, Matthew
  • An algorithm for finding factorizations of complete graphs. Hilton, A. J. W.; Johnson, Matthew
  • The external network problem with edge- or arc-connectivity requirements. van den Heuvel, Jan; Johnson, Matthew
  • The external network problem. van den Heuvel, Jan; Johnson, Matthew