 | 2008 |
| 22 |  | Dillon Mayhew,
Gordon F. Royle:
Matroids with nine elements.
J. Comb. Theory, Ser. B 98(2): 415-431 (2008) |
| 2007 |
| 21 |  | Aidan Roy,
Gordon F. Royle:
The chromatic number and rank of the complements of the Kasami graphs.
Discrete Mathematics 307(1): 132-136 (2007) |
| 20 |  | Gordon F. Royle:
Graphs with Chromatic Roots in the Interval (1, 2).
Electr. J. Comb. 14(1): (2007) |
| 19 |  | Koenraad Audenaert,
Chris D. Godsil,
Gordon F. Royle,
Terry Rudolph:
Symmetric squares of graphs.
J. Comb. Theory, Ser. B 97(1): 74-90 (2007) |
| 2006 |
| 18 |  | Ameera Chowdhury,
Chris D. Godsil,
Gordon F. Royle:
Colouring lines in projective space.
J. Comb. Theory, Ser. A 113(1): 39-52 (2006) |
| 2004 |
| 17 |  | Matthew R. Brown,
Christine M. O'Keefe,
Stanley E. Payne,
Tim Penttila,
Gordon F. Royle:
Spreads of T2(o), alpha-flocks and Ovals.
Des. Codes Cryptography 31(3): 251-282 (2004) |
| 16 |  | Gordon F. Royle,
Alan D. Sokal:
The Brown-Colbourn conjecture on zeros of reliability polynomials is false.
J. Comb. Theory, Ser. B 91(2): 345-360 (2004) |
| 2003 |
| 15 |  | Gordon F. Royle:
The Rank of a Cograph.
Electr. J. Comb. 10: (2003) |
| 2001 |
| 14 |  | Chris D. Godsil,
Gordon F. Royle:
Chromatic Number and the 2-Rank of a Graph.
J. Comb. Theory, Ser. B 81(1): 142-149 (2001) |
| 1998 |
| 13 |  | David Clark,
Cara MacNish,
Gordon F. Royle:
Java as a teaching language—opportunities, pitfalls and solutions.
ACSE 1998: 173-179 |
| 12 |  | Gordon F. Royle:
An orderly algorithm and some applications in finite geometry.
Discrete Mathematics 185(1-3): 105-115 (1998) |
| 1997 |
| 11 |  | Rowan Davies,
Gordon F. Royle:
Graph Domination, Tabu Search and the Football Pool Problem.
Discrete Applied Mathematics 74(3): 217-228 (1997) |
| 1996 |
| 10 |  | Donald L. Kreher,
Gordon F. Royle,
W. D. Wallis:
A family of resolvable regular graph designs.
Discrete Mathematics 156(1-3): 269-275 (1996) |
| 1995 |
| 9 |  | Rudolf Mathon,
Gordon F. Royle:
The Translation Planes of Order 49.
Des. Codes Cryptography 5(1): 57-72 (1995) |
| 8 |  | Tim Penttila,
Gordon F. Royle:
Sets of Type (m, n) in the Affine and Projective Planes of Order Nine.
Des. Codes Cryptography 6(3): 229-245 (1995) |
| 1992 |
| 7 |  | D. de Caen,
Chris D. Godsil,
Gordon F. Royle:
On the p-Rank of Incidence Matrices and a Bound of Bruen and Ott.
Des. Codes Cryptography 2(4): 391-394 (1992) |
| 6 |  | Anthony D. Gardiner,
Chris D. Godsil,
A. D. Hensel,
Gordon F. Royle:
Second neighbourhoods of strongly regular graphs.
Discrete Mathematics 103(2): 161-170 (1992) |
| 5 |  | Mark N. Ellingham,
Gordon F. Royle:
Vertex-switching reconstruction of subgraph numbers and triangle-free graphs.
J. Comb. Theory, Ser. B 54(2): 167-177 (1992) |
| 1991 |
| 4 |  | Yeow Meng Chee,
Gordon F. Royle:
The 2-rotational Steiner triple systems of order 25.
Discrete Mathematics 97(1-3): 93-100 (1991) |
| 1989 |
| 3 |  | Gordon F. Royle,
Cheryl E. Praeger:
Constructing the Vertex-Transitive Graphs of Order 24.
J. Symb. Comput. 8(4): 309-326 (1989) |
| 1988 |
| 2 |  | P. H. Fisher,
Tim Penttila,
Gordon F. Royle:
Symmetric designs, polarities and sub-designs.
Discrete Mathematics 71(1): 19-32 (1988) |
| 1987 |
| 1 |  | Gordon F. Royle:
The Transitive Groups of Degree Twelve.
J. Symb. Comput. 4(2): 255-268 (1987) |