Search the dblp DataBase

Publications of Author

1. Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart
   The Computational Complexity of the Parallel Knock-Out Problem. [Citation Graph (0, 0)][DBLP]
   LATIN, 2006, pp:250-261 [Conf]
   
2. Anthony J. W. Hilton, Matthew Johnson 0002
   Amalgamations of factorizations of complete equipartite graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:284, n:1-3, pp:157-175 [Journal]
   
3. David Bedford, Matthew Johnson 0002, Matthew A. Ollis
   Defining sets for Latin squares given that they are based on groups. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 2003, v:24, n:1, pp:129-135 [Journal]
   
4. Anthony J. W. Hilton, Matthew Johnson 0002, Christopher A. Rodger, Evan B. Wantland
   Amalgamations of connected k-factorizations. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:267-279 [Journal]
   
5. Changiz Eslahchi, Matthew Johnson 0002
   Characterization of graphs with hall number 2. [Citation Graph (0, 0)][DBLP]
   Journal of Graph Theory, 2004, v:45, n:2, pp:81-100 [Journal]
   
6. Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma
   Upper Bounds and Algorithms for Parallel Knock-Out Numbers. [Citation Graph (0, 0)][DBLP]
   SIROCCO, 2007, pp:328-340 [Conf]
   
7. 
   Obtaining Online Ecological Colourings by Generalizing First-Fit. [Citation Graph (, )][DBLP]
   
   
8. 
   Path factors and parallel knock-out schemes of almost claw-free graphs. [Citation Graph (, )][DBLP]