A doubling construction for room squares. - W. D. Wallis (Discret. Math., 1972)

Configurations Arising from Maximal Arcs. - W. D. Wallis (J. Comb. Theory A, 1973)

Room Squares with Sub-squares. - W. D. Wallis (J. Comb. Theory A, 1973)

Solution of the Room Square Existence Problem. - W. D. Wallis (J. Comb. Theory A, 1974)

Graphs with symmetric automorphism group. - Walter D. Wallis; Katherine Heinrich (J. Graph Theory, 1978)

On the existence of frames. - Ronald C. Mullin; Paul J. Schellenberg; Scott A. Vanstone; W. D. Wallis (Discret. Math., 1981)

Asymptotic values of clique partition numbers. - W. D. Wallis (Comb., 1982)

Premature sets of 1-factors or how not to schedule round robin tournaments. - Alexander Rosa; Walter D. Wallis (Discret. Appl. Math., 1982)

On one-factorizations of compositions of graphs. - P. Himelwright; W. D. Wallis; J. E. Williamson (J. Graph Theory, 1982)

Room squares with holes of sides 3, 5, and 7. - Jeffrey H. Dinitz; Douglas R. Stinson; W. D. Wallis (Discret. Math., 1983)

Two-fold triple systems without repeated blocks. - Douglas R. Stinson; W. D. Wallis (Discret. Math., 1983)

Clique partitions of the cocktail party graph. - David A. Gregory; Sean McGuinness; Walter D. Wallis (Discret. Math., 1986)

Indecomposable factorizations of multigraphs. - A. H. Baartmans; W. D. Wallis (Discret. Math., 1989)

Not all perfect extrinsic secret sharing schemes are ideal. - W. D. Wallis (Australas. J Comb., 1990)

Generalized clique coverings of chordal graphs. - W. D. Wallis; Julin Wu (Australas. J Comb., 1990)

The spectrum of maximal sets of one-factors. - Rolf S. Rees; Walter D. Wallis (Discret. Math., 1991)

On clique partitions of split graphs. - W. D. Wallis; Julin Wu (Discret. Math., 1991)

A geometric construction of the Steiner system S(4, 7, 23). - Alphonse Baartmans; Walter D. Wallis; Joseph L. Yucas (Discret. Math., 1992)

Note on the parameters of balanced designs. - Walter D. Wallis (Australas. J Comb., 1993)

Cubic Arcs in Cubic Nets. - Vassili C. Mavron; W. D. Wallis (Des. Codes Cryptogr., 1993)

Single Change Covering Designs. - Walter D. Wallis; Joseph L. Yucas; Guo-Hui Zhang (Des. Codes Cryptogr., 1993)

On the partition and coloring of a graph by cliques. - W. D. Wallis; Guo-Hui Zhang (Discret. Math., 1993)

Maximal sets of triangle- factors. - Rolf S. Rees; Alexander Rosa; Walter D. Wallis (Australas. J Comb., 1994)

Single change neighbor designs. - Robert L. Constable; Donald A. Preece; Nicholas C. K. Phillips; Thomas Dale Porter; Walter D. Wallis (Australas. J Comb., 1995)

Symmetric and skew equivalence of Hadamard matrices of order 28. - A. H. Baartmans; Cantian Lin; Walter D. Wallis (Ars Comb., 1995)

On the spectrum on maximal k-multiple free sets of integers. - W. D. Wallis; Wan-Di Wei (Ars Comb., 1995)

Squares, clique graphs, and chordality. - W. D. Wallis; Julin Wu (J. Graph Theory, 1995)

A family of resolvable regular graph designs. - Donald L. Kreher; Gordon F. Royle; W. D. Wallis (Discret. Math., 1996)

Perfect double covers with paths of length four. - Katherine Heinrich; P. Horak; Walter D. Wallis; Qinglin Yu (J. Graph Theory, 1996)

Counting frequencies of configurations in Steiner Triple Systems. - Peter Horák; Nicholas C. K. Phillips; Walter D. Wallis; Joseph L. Yucas (Ars Comb., 1997)

Kirkman's school projects. - Anton Cerný; Peter Horák; Walter D. Wallis (Discret. Math., 1997)

Minimum Order of a Graph with Given Deficiency and Either Minimum or Maximum Degree. - Purwanto; W. D. Wallis (Ars Comb., 1998)

Skew-Hadamard Matrices and the Smith Normal Form. - T. S. Michael; W. D. Wallis (Des. Codes Cryptogr., 1998)

The Existence of Self-Conjugate Self-Orthogonal Idempotent Diagonal Latin Squares. - Beiliang Du; W. D. Wallis (Ars Comb., 1999)

Maximal sets of mutually orthogonal Latin squares. - David A. Drake; G. H. John van Rees; W. D. Wallis (Discret. Math., 1999)

Edge-magic total labelings. - Walter D. Wallis; Edy Tri Baskoro; Mirka Miller; Slamin (Australas. J Comb., 2000)

Survey of certain valuations of graphs. - Martin Baca; Jim A. MacDougall; Mirka Miller; Slamin; Walter D. Wallis (Discuss. Math. Graph Theory, 2000)

Packings and coverings of v=3m+1 points with near-triangle factors. - Nicholas C. K. Phillips; W. D. Wallis; Rolf S. Rees (Australas. J Comb., 2001)

Graph distances using graph union. - Walter D. Wallis; Peter Shoubridge; Miro Kraetzl; D. Ray (Pattern Recognit. Lett., 2001)

Totally magic graphs. - Geoffrey Exoo; Alan C. H. Ling; John P. McSorley; Nicholas C. K. Phillips; Walter D. Wallis (Discret. Math., 2002)

Factoring the cartesian product of a cubic graph and a triangle. - Joseph Douglas Horton; Walter D. Wallis (Discret. Math., 2002)

Detection of Abnormal Change in a Time Series of Graphs. - Peter Shoubridge; Miro Kraetzl; Walter D. Wallis; Horst Bunke (J. Interconnect. Networks, 2002)

Strong edge-magic labelling of a cycle with a chord. - Jim A. MacDougall; Walter D. Wallis (Australas. J Comb., 2003)

Vertex-Magic Total Labelings of Complete Bipartite Graphs. - Ian D. Gray; Jim A. MacDougall; R. J. Simpson; Walter D. Wallis (Ars Comb., 2003)

Vertex-magic labeling of trees and forests. - Ian D. Gray; Jim A. MacDougall; John P. McSorley; Walter D. Wallis (Discret. Math., 2003)

On constant-weight TSP-tours. - Scott Jones; P. Mark Kayll; Bojan Mohar; Walter D. Wallis (Discuss. Math. Graph Theory, 2003)

Paley triple arrays. - Donald A. Preece; Walter D. Wallis; Joseph L. Yucas (Australas. J Comb., 2005)

On totally magic injections. - W. D. Wallis; R. A. Yates (Australas. J Comb., 2005)

Double Arrays, Triple Arrays and Balanced Grids. - John P. McSorley; Nicholas C. K. Phillips; Walter D. Wallis; Joseph L. Yucas (Des. Codes Cryptogr., 2005)

The seven classes of 5×6 triple arrays. - Nicholas C. K. Phillips; Donald A. Preece; Walter D. Wallis (Discret. Math., 2005)

Using graph diameter for change detection in dynamic networks. - Matthew E. Gaston; Miro Kraetzl; Walter D. Wallis (Australas. J Comb., 2006)

Closed-neighbourhood anti-Sperner graphs. - John P. McSorley; Alison Marr; Thomas Dale Porter; Walter D. Wallis (Australas. J Comb., 2007)

Bimagic Labelings. - Alison Marr; Nick Phillips; Walter D. Wallis (IWOCA, 2008)

Strong edge-magic graphs of maximum size. - Jim A. MacDougall; Walter D. Wallis (Discret. Math., 2008)

On the anomalous behaviour of a class of locality statistics. - Carey E. Priebe; Walter D. Wallis (Discret. Math., 2008)

Triple arrays and related designs. - W. D. Wallis (Discret. Appl. Math., 2014)