default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWalter D. Wallis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
[j56]W. D. Wallis:
Triple arrays and related designs. Discret. Appl. Math. 163: 220-236 (2014)- 2008
- [j55]Carey E. Priebe, Walter D. Wallis:
On the anomalous behaviour of a class of locality statistics. Discret. Math. 308(10): 2034-2037 (2008) - [j54]Jim A. MacDougall, Walter D. Wallis:
Strong edge-magic graphs of maximum size. Discret. Math. 308(13): 2756-2763 (2008) - 2007
- [j53]John P. McSorley, Alison Marr, Thomas Dale Porter, Walter D. Wallis:
Closed-neighbourhood anti-Sperner graphs. Australas. J Comb. 38: 63-76 (2007) - 2006
- [j52]Matthew E. Gaston, Miro Kraetzl, Walter D. Wallis:
Using graph diameter for change detection in dynamic networks. Australas. J Comb. 35: 299-312 (2006) - 2005
- [j51]W. D. Wallis, R. A. Yates:
On totally magic injections. Australas. J Comb. 32: 339- (2005) - [j50]Donald A. Preece, Walter D. Wallis, Joseph L. Yucas:
Paley triple arrays. Australas. J Comb. 33: 237-246 (2005) - [j49]John P. McSorley, Nicholas C. K. Phillips, Walter D. Wallis, Joseph L. Yucas:
Double Arrays, Triple Arrays and Balanced Grids. Des. Codes Cryptogr. 35(1): 21-45 (2005) - [j48]Nicholas C. K. Phillips, Donald A. Preece, Walter D. Wallis:
The seven classes of 5×6 triple arrays. Discret. Math. 293(1-3): 213-218 (2005) - 2003
- [j47]Jim A. MacDougall, Walter D. Wallis:
Strong edge-magic labelling of a cycle with a chord. Australas. J Comb. 28: 245-256 (2003) - [j46]Ian D. Gray, Jim A. MacDougall, R. J. Simpson, Walter D. Wallis:
Vertex-Magic Total Labelings of Complete Bipartite Graphs. Ars Comb. 69 (2003) - [j45]Ian D. Gray, Jim A. MacDougall, John P. McSorley, Walter D. Wallis:
Vertex-magic labeling of trees and forests. Discret. Math. 261(1-3): 285-298 (2003) - [j44]Scott Jones, P. Mark Kayll, Bojan Mohar, Walter D. Wallis:
On constant-weight TSP-tours. Discuss. Math. Graph Theory 23(2): 287-307 (2003) - 2002
- [j43]Geoffrey Exoo, Alan C. H. Ling, John P. McSorley, Nicholas C. K. Phillips, Walter D. Wallis:
Totally magic graphs. Discret. Math. 254(1-3): 103-113 (2002) - [j42]Joseph Douglas Horton, Walter D. Wallis:
Factoring the cartesian product of a cubic graph and a triangle. Discret. Math. 259(1-3): 137-146 (2002) - [j41]Peter Shoubridge, Miro Kraetzl, Walter D. Wallis, Horst Bunke:
Detection of Abnormal Change in a Time Series of Graphs. J. Interconnect. Networks 3(1-2): 85-101 (2002) - 2001
- [j40]Nicholas C. K. Phillips, W. D. Wallis, Rolf S. Rees:
Packings and coverings of v=3m+1 points with near-triangle factors. Australas. J Comb. 23: 53-70 (2001) - [j39]Walter D. Wallis, Peter Shoubridge, Miro Kraetzl, D. Ray:
Graph distances using graph union. Pattern Recognit. Lett. 22(6/7): 701-704 (2001) - 2000
- [j38]Walter D. Wallis, Edy Tri Baskoro, Mirka Miller, Slamin:
Edge-magic total labelings. Australas. J Comb. 22: 177-190 (2000) - [j37]Martin Baca, Jim A. MacDougall, Mirka Miller, Slamin, Walter D. Wallis:
Survey of certain valuations of graphs. Discuss. Math. Graph Theory 20(2): 219-229 (2000) - 1999
- [j36]Beiliang Du, W. D. Wallis:
The Existence of Self-Conjugate Self-Orthogonal Idempotent Diagonal Latin Squares. Ars Comb. 53 (1999) - [j35]David A. Drake, G. H. John van Rees, W. D. Wallis:
Maximal sets of mutually orthogonal Latin squares. Discret. Math. 194(1-3): 87-94 (1999) - 1998
- [j34]Purwanto, W. D. Wallis:
Minimum Order of a Graph with Given Deficiency and Either Minimum or Maximum Degree. Ars Comb. 50 (1998) - [j33]T. S. Michael, W. D. Wallis:
Skew-Hadamard Matrices and the Smith Normal Form. Des. Codes Cryptogr. 13(2): 173-176 (1998) - 1997
- [j32]Peter Horák, Nicholas C. K. Phillips, Walter D. Wallis, Joseph L. Yucas:
Counting frequencies of configurations in Steiner Triple Systems. Ars Comb. 46 (1997) - [j31]Anton Cerný, Peter Horák, Walter D. Wallis:
Kirkman's school projects. Discret. Math. 167-168: 189-196 (1997) - 1996
- [j30]Donald L. Kreher
, Gordon F. Royle, W. D. Wallis:
A family of resolvable regular graph designs. Discret. Math. 156(1-3): 269-275 (1996) - [j29]Katherine Heinrich, P. Horak, Walter D. Wallis, Qinglin Yu:
Perfect double covers with paths of length four. J. Graph Theory 21(2): 187-197 (1996) - 1995
- [j28]Robert L. Constable, Donald A. Preece, Nicholas C. K. Phillips, Thomas Dale Porter, Walter D. Wallis:
Single change neighbor designs. Australas. J Comb. 11: 247-256 (1995) - [j27]A. H. Baartmans, Cantian Lin, Walter D. Wallis:
Symmetric and skew equivalence of Hadamard matrices of order 28. Ars Comb. 41 (1995) - [j26]W. D. Wallis, Wan-Di Wei:
On the spectrum on maximal k-multiple free sets of integers. Ars Comb. 41 (1995) - [j25]W. D. Wallis, Julin Wu:
Squares, clique graphs, and chordality. J. Graph Theory 20(1): 37-45 (1995) - 1994
- [j24]Rolf S. Rees, Alexander Rosa, Walter D. Wallis:
Maximal sets of triangle- factors. Australas. J Comb. 9: 67-108 (1994) - 1993
- [j23]Walter D. Wallis:
Note on the parameters of balanced designs. Australas. J Comb. 8: 75-76 (1993) - [j22]Walter D. Wallis, Joseph L. Yucas, Guo-Hui Zhang:
Single Change Covering Designs. Des. Codes Cryptogr. 3(1): 9-19 (1993) - [j21]Vassili C. Mavron, W. D. Wallis:
Cubic Arcs in Cubic Nets. Des. Codes Cryptogr. 3(2): 99-104 (1993) - [j20]W. D. Wallis, Guo-Hui Zhang:
On the partition and coloring of a graph by cliques. Discret. Math. 120(1-3): 191-203 (1993) - 1992
- [j19]Alphonse Baartmans, Walter D. Wallis, Joseph L. Yucas:
A geometric construction of the Steiner system S(4, 7, 23). Discret. Math. 102(2): 177-186 (1992) - 1991
- [j18]W. D. Wallis, Julin Wu:
On clique partitions of split graphs. Discret. Math. 92(1-3): 427-429 (1991) - [j17]Rolf S. Rees, Walter D. Wallis:
The spectrum of maximal sets of one-factors. Discret. Math. 97(1-3): 357-369 (1991) - 1990
- [j16]W. D. Wallis, Julin Wu:
Generalized clique coverings of chordal graphs. Australas. J Comb. 1: 233-236 (1990) - [j15]W. D. Wallis:
Not all perfect extrinsic secret sharing schemes are ideal. Australas. J Comb. 2: 237- (1990) - 1989
- [j14]A. H. Baartmans, W. D. Wallis:
Indecomposable factorizations of multigraphs. Discret. Math. 78(1-2): 37-43 (1989) - 1986
- [j13]David A. Gregory, Sean McGuinness, Walter D. Wallis:
Clique partitions of the cocktail party graph. Discret. Math. 59(3): 267-273 (1986) - 1984
- [j12]P. Himelwright, W. D. Wallis, J. E. Williamson:
On one-factorizations of compositions of graphs. J. Graph Theory 8(1): 185-186 (1984) - 1983
- [j11]Douglas R. Stinson, W. D. Wallis:
Two-fold triple systems without repeated blocks. Discret. Math. 47: 125-128 (1983) - [j10]Jeffrey H. Dinitz, Douglas R. Stinson, W. D. Wallis:
Room squares with holes of sides 3, 5, and 7. Discret. Math. 47: 221-228 (1983) - 1982
- [j9]W. D. Wallis:
Asymptotic values of clique partition numbers. Comb. 2(1): 99-101 (1982) - [j8]Alexander Rosa, Walter D. Wallis:
Premature sets of 1-factors or how not to schedule round robin tournaments. Discret. Appl. Math. 4(4): 291-297 (1982) - [j7]P. Himelwright, W. D. Wallis, J. E. Williamson:
On one-factorizations of compositions of graphs. J. Graph Theory 6(1): 75-80 (1982) - 1981
- [j6]Ronald C. Mullin, Paul J. Schellenberg, Scott A. Vanstone, W. D. Wallis:
On the existence of frames. Discret. Math. 37(1): 79-104 (1981) - 1978
- [j5]Walter D. Wallis, Katherine Heinrich:
Graphs with symmetric automorphism group. J. Graph Theory 2(4): 329-336 (1978) - 1974
- [j4]W. D. Wallis:
Solution of the Room Square Existence Problem. J. Comb. Theory A 17(3): 379-383 (1974) - 1973
- [j3]W. D. Wallis:
Configurations Arising from Maximal Arcs. J. Comb. Theory A 15(1): 115-119 (1973) - [j2]W. D. Wallis:
Room Squares with Sub-squares. J. Comb. Theory A 15(3): 329-332 (1973) - 1972
- [j1]W. D. Wallis:
A doubling construction for room squares. Discret. Math. 3(4): 397-399 (1972)
Conference and Workshop Papers
- 2008
- [c1]Alison Marr, Nick Phillips, Walter D. Wallis:
Bimagic Labelings. IWOCA 2008: 83-88
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
