The following pages link to Walter D. Wallis (Q1051002):
Displaying 50 items.
- (Q594098) (redirect page) (← links)
- (Q1076690) (redirect page) (← links)
- Room squares with holes of sides 3, 5, and 7 (Q594099) (← links)
- Bimagic labelings (Q624121) (← links)
- On the partition and coloring of a graph by cliques (Q687122) (← links)
- Indecomposable factorizations of multigraphs (Q757441) (← links)
- An even side analogue of Room squares (Q797589) (← links)
- Strong edge-magic graphs of maximum size (Q924958) (← links)
- On the anomalous behaviour of a class of locality statistics (Q952670) (← links)
- Premature sets of 1-factors or how not to schedule round robin tournaments (Q1051003) (← links)
- Two-fold triple systems without repeated blocks (Q1056751) (← links)
- Clique partitions of the cocktail party graph (Q1076691) (← links)
- On the existence of frames (Q1154469) (← links)
- Asymptotic values of clique partition numbers (Q1167740) (← links)
- On clique partitions of split graphs (Q1182960) (← links)
- The spectrum of maximal sets of one-factors (Q1184003) (← links)
- A geometric construction of the Steiner system \(S(4,7,23)\) (Q1193715) (← links)
- Single change covering designs (Q1209218) (← links)
- Solution of the Room square existence problem (Q1214933) (← links)
- The existence of Room squares (Q1220936) (← links)
- Construction of skew room squares (Q1244238) (← links)
- Maximal sets of mutually orthogonal Latin squares (Q1297474) (← links)
- Kirkman's school projects (Q1356458) (← links)
- Skew-Hadamard matrices and the Smith normal form (Q1378886) (← links)
- Totally magic graphs (Q1613532) (← links)
- The seven classes of \(5\times 6\) triple arrays (Q1779500) (← links)
- Factoring the Cartesian product of a cubic graph and a triangle (Q1861207) (← links)
- Vertex-magic labeling of trees and forests (Q1861297) (← links)
- Regular graph designs (Q1918205) (← links)
- A family of resolvable regular graph designs (Q1923524) (← links)
- Room squares with sub-squares (Q2264769) (← links)
- A graph-theoretic approach to enterprise network dynamics. (Q2432941) (← links)
- Triple arrays and related designs (Q2434739) (← links)
- Combinatorics. Room squares, sum-free sets, Hadamard matrices (Q2515174) (← links)
- A reduction of the problem of semisimplicity (Q2530043) (← links)
- Generalization of stability (Q2535705) (← links)
- Equivalence of Hadamard matrices (Q2541688) (← links)
- On the existence of Room squares of order \(4n\) (Q2552136) (← links)
- Integral equivalence of Hadamard matrices (Q2552872) (← links)
- Some notes on integral equivalence of combinatorial matrices (Q2552873) (← links)
- A doubling construction for Room squares (Q2556335) (← links)
- Configurations arising from maximal arcs (Q2560827) (← links)
- On the existence of Room squares (Q2562862) (← links)
- Double arrays, triple arrays and balanced grids (Q2572958) (← links)
- (Q2706949) (← links)
- (Q2712510) (← links)
- (Q2716666) (← links)
- (Q2723258) (← links)
- Survey of certain valuations of graphs (Q2725185) (← links)
- Pancyclic and Bipancyclic Graphs (Q2799543) (← links)
- Introduction to Combinatorics (Q2829615) (← links)
