- There Are No Non-Trivially Uniformly (t, r)-Regular Graphs for t > 2.
- Complete Enumeration and Properties of binary Pseudo -Youden Designs PYD(9, 6, 6)
- Double Arrays, Triple Arrays and Balanced Grids
- Kp-Removable Sequences of Graphs John P. McSorley
- Constructing t-designs from t-wise balanced John P. McSorley and Leonard H. Soicher
- Bounds for Overfull Sets of One-Factors J. P. McSorley and W. D. Wallis
- Orthogonal arrays of strength three from regular 3-wise balanced designs
- ELSEVIER Discrete Mathematics 197/198 (1999) 561-588 MATHEMATICS
- TIGHT SINGLE-CHANGE COVERING DESIGNS D. A. PREECE
- Neighborhood Champions in Regular J. P. McSorley and W. D. Wallis,
- Comment on "The Expectation Of Independent Domination Number
- Closed-Neighborhood Anti-Sperner Graphs John P. McSorley,
- Totally Magic Injections of Graphs John P. McSorley
- Generating Sequences of Clique-Symmetric Graphs via Eulerian Digraphs
- Totally Magic Graphs Geoffrey Exoo
- A Generalized Coloring of Graphs Department of Computer Science
- Generating Orthogonal Polynomials and their Derivatives using
- A Combinatorial Interpretation of Bessel Polynomials and their First Derivatives
- ENUMERATING LABELLED GRAPHS WITH CERTAIN NEIGHBORHOOD
- Multivariate Matching Polynomials of Cyclically Labelled Graphs
- On k-minimum and m-minimum Edge-Magic Injections of Graphs
- CYCLIC PERMUTATIONS IN DOUBLY-TRANSITIVE GROUPS John P. McSorley
- Double Arrays, Triple Arrays, and Balanced Grids with v = r + c -1
- A Combinatorial Interpretation of Lommel Polynomials and Their Derivatives
- c~ DISCRETEMATHEMATICS ELSEVIER Discrete Mathematics 184 (1998) 137-164
- Constructing and Classifying Neighborhood Anti-Sperner Graphs
- Clique-Symmetric Uniform Hypergraphs John P. McSorley
- A Generalized Coloring of Graphs Ashok Amin
- On k-minimum and m-minimum Edge-Magic Injections of Graphs
- Constructing t-designs from t-wise balanced designs
- A Combinatorial Interpretation of Bessel Polynomials and their First Derivatives
- There Are No Non-Trivially Uniformly (t, r)-Regular Graphs for t > 2.
- TIGHT SINGLE-CHANGE COVERING DESIGNS D. A. PREECE
- Generating Sequences of Clique-Symmetric Graphs via Eulerian Digraphs
- On the Spectra of Totally Magic Labelings
- Discrete Mathematics 261 (2003) 285298 www.elsevier.com/locate/disc
- Totally Magic Graphs Geoffrey Exoo
- Totally Magic Injections of Graphs John P. McSorley
- A Combinatorial Interpretation of Lommel Polynomials and Their Derivatives
- Constructing and Classifying Neighborhood Anti-Sperner Graphs
- Closed-Neighborhood Anti-Sperner Graphs John P. McSorley,
- ENUMERATING LABELLED GRAPHS WITH CERTAIN NEIGHBORHOOD
- Double Arrays, Triple Arrays, and Balanced Grids with v = r + c -1
- Generating Orthogonal Polynomials and their Derivatives using
- Bounds for Overfull Sets of One-Factors J. P. McSorley and W. D. Wallis
- Orthogonal arrays of strength three from regular 3-wise balanced designs
- Comment on "The Expectation Of Independent Domination Number
- On the Spectra of Totally Magic J. P. McSorley and W. D. Wallis
- Anomaly Graphs and Champions J. P. McSorley
- Double Arrays, Triple Arrays and Balanced Grids
- Kp -Removable Sequences of Graphs John P. McSorley
- Clique-Symmetric Uniform Hypergraphs John P. McSorley
- Multivariate Matching Polynomials of Cyclically Labelled Graphs
- CYCLIC PERMUTATIONS IN DOUBLY-TRANSITIVE GROUPS John P. McSorley
- Complete Enumeration and Properties of binary Pseudo -Youden Designs PYD(9, 6, 6)
- Neighborhood Champions in Regular Graphs
- Hindawi Publishing Corporation International Journal of Combinatorics