Bipartite graphs with even spanning trees. - Dean G. Hoffman; Matt Walsh 001 (Australas. J Comb., 2006)

Routing sets in the integer lattice. - Peter Hamburger; Robert C. Vandell; Matt Walsh 001 (Discret. Appl. Math., 2007)

Fractional domination in prisms. - Matthew Walsh 001 (Discuss. Math. Graph Theory, 2007)

Fractional inverse and inverse fractional domination. - Peter D. Johnson Jr.; Matt Walsh 001 (Ars Comb., 2008)

Hamiltonicity and restricted block-intersection graphs of t-designs. - David A. Pike; Robert C. Vandell; Matthew Walsh 001 (Discret. Math., 2009)

Minimum fractional dominating functions and maximum fractional packing functions. - Robert R. Rubalcaba; Matt Walsh 001 (Discret. Math., 2009)

Minimum broadcast tree decompositions. - Matthew Walsh 001 (Discret. Math., 2009)

Kneser Representations of Graphs. - Peter Hamburger; Attila Pór; Matt Walsh 001 (SIAM J. Discret. Math., 2009)

The connected hub number and the connected domination number. - Peter D. Johnson Jr.; Peter Slater; Matt Walsh 001 (Networks, 2011)

A colour-sliding problem on graphs. - Landan Hicks; Marc J. Lipman; Matt Walsh 001 (Australas. J Comb., 2014)

On Compact Symmetric Regularizations of Graphs. - Robert C. Vandell; Matt Walsh 001; William D. Weakley (Electron. J. Comb., 2014)

Closed-neighborhood union-closed graphs. - Kelly Guest; Sarah H. Holliday; Peter D. Johnson Jr.; Dieter Rautenbach; Matthew Walsh 001 (Australas. J Comb., 2020)