The Transitive Groups of Degree Twelve. - Gordon F. Royle (J. Symb. Comput., 1987)

Symmetric designs, polarities and sub-designs. - P. H. Fisher; Tim Penttila; Gordon F. Royle (Discret. Math., 1988)

An 11-vertex theorem for 3-connected cubic graphs. - Robert E. L. Aldred; Sheng Bau; Derek A. Holton; Gordon F. Royle (J. Graph Theory, 1988)

Inversive Planes of Odd Order. - P. H. Fisher; Tim Penttila; Cheryl E. Praeger; Gordon F. Royle (Eur. J. Comb., 1989)

Constructing the Vertex-Transitive Graphs of Order 24. - Gordon F. Royle; Cheryl E. Praeger (J. Symb. Comput., 1989)

Constructing the vertex-transitive graphs on 24 vertices. - Gordon F. Royle (SIGSAM Bull., 1991)

The 2-rotational Steiner triple systems of order 25. - Yeow Meng Chee; Gordon F. Royle (Discret. Math., 1991)

On the p-Rank of Incidence Matrices and a Bound of Bruen and Ott. - D. de Caen; Chris D. Godsil; Gordon F. Royle (Des. Codes Cryptogr., 1992)

Second neighbourhoods of strongly regular graphs. - Anthony D. Gardiner; Chris D. Godsil; A. D. Hensel; Gordon F. Royle (Discret. Math., 1992)

Vertex-switching reconstruction of subgraph numbers and triangle-free graphs. - Mark N. Ellingham; Gordon F. Royle (J. Comb. Theory B, 1992)

The Translation Planes of Order 49. - Rudolf Mathon; Gordon F. Royle (Des. Codes Cryptogr., 1995)

Sets of Type (m, n) in the Affine and Projective Planes of Order Nine. - Tim Penttila; Gordon F. Royle (Des. Codes Cryptogr., 1995)

Small graphs with chromatic number 5: A computer search. - Tommy R. Jensen; Gordon F. Royle (J. Graph Theory, 1995)

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

Graph Domination, Tabu Search and the Football Pool Problem. - Rowan Davies; Gordon F. Royle (Discret. Appl. Math., 1997)

Java as a teaching language - opportunities, pitfalls and solutions. - David Clark; Cara MacNish; Gordon F. Royle (ACSE, 1998)

BLT-sets over small fields. - Tim Penttila; Gordon F. Royle (Australas. J Comb., 1998)

An orderly algorithm and some applications in finite geometry. - Gordon F. Royle (Discret. Math., 1998)

Hajós constructions of critical graphs. - Tommy R. Jensen; Gordon F. Royle (J. Graph Theory, 1999)

Algebraic Graph Theory. - Christopher D. Godsil; Gordon F. Royle (Springer, 2001)

Chromatic Number and the 2-Rank of a Graph. - Chris D. Godsil; Gordon F. Royle (J. Comb. Theory B, 2001)

Regular vertex diameter critical graphs. - Gordon F. Royle (Australas. J Comb., 2002)

The Rank of a Cograph. - Gordon F. Royle (Electron. J. Comb., 2003)

Spreads of T2(o), alpha-flocks and Ovals. - Matthew R. Brown 001; Christine M. O'Keefe; Stanley E. Payne; Tim Penttila; Gordon F. Royle (Des. Codes Cryptogr., 2004)

The Brown-Colbourn conjecture on zeros of reliability polynomials is false. - Gordon F. Royle; Alan D. Sokal (J. Comb. Theory B, 2004)

Colouring lines in projective space. - Ameera Chowdhury; Chris D. Godsil; Gordon F. Royle (J. Comb. Theory A, 2006)

Graphs with Chromatic Roots in the Interval (1, 2). - Gordon F. Royle (Electron. J. Comb., 2007)

The chromatic number and rank of the complements of the Kasami graphs. - Aidan Roy; Gordon F. Royle (Discret. Math., 2007)

Symmetric squares of graphs. - Koenraad Audenaert; Chris D. Godsil; Gordon F. Royle; Terry Rudolph (J. Comb. Theory B, 2007)

Matroids with nine elements. - Dillon Mayhew; Gordon F. Royle (J. Comb. Theory B, 2008)

Designs from Matroids. - Thomas Britz; Gordon F. Royle; Keisuke Shiromoto (SIAM J. Discret. Math., 2009)

Edge-Selection Heuristics for Computing Tutte Polynomials. - David J. Pearce 001; Gary Haggard; Gordon F. Royle (Chic. J. Theor. Comput. Sci., 2010)

Computing Tutte Polynomials. - Gary Haggard; David J. Pearce 001; Gordon F. Royle (ACM Trans. Math. Softw., 2010)

Chromatic Roots of a Ring of Four Cliques. - Feng Ming Dong; Gordon F. Royle; Dave Wagner (Electron. J. Comb., 2011)

Graphs whose flow polynomials have only integral roots. - Joseph P. S. Kung; Gordon F. Royle (Eur. J. Comb., 2011)

Generalised quadrangles with a group of automorphisms acting primitively on points and lines. - John Bamberg; Michael Giudici; Joy Morris; Gordon F. Royle; Pablo Spiga (J. Comb. Theory A, 2012)

Set-homogeneous directed graphs. - Robert Gray; Dugald Macpherson; Cheryl E. Praeger; Gordon F. Royle (J. Comb. Theory B, 2012)

The Internally 4-Connected Binary Matroids with No $M(K_{5} backslash e)$-Minor. - Dillon Mayhew; Gordon F. Royle (SIAM J. Discret. Math., 2012)

Hemisystems of small flock generalized quadrangles. - John Bamberg; Michael Giudici; Gordon F. Royle (Des. Codes Cryptogr., 2013)

The Merino-Welsh conjecture holds for series-parallel graphs. - Steven D. Noble; Gordon F. Royle (Eur. J. Comb., 2014)

Maximum Size Binary Matroids with no AG(3, 2)-Minor are Graphic. - Joseph P. S. Kung; Dillon Mayhew; Irene Pivotto; Gordon F. Royle (SIAM J. Discret. Math., 2014)

Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs. - Gordon F. Royle; Alan D. Sokal (SIAM J. Discret. Math., 2015)

Quartic Graphs with Every Edge in a Triangle. - Florian Pfender; Gordon F. Royle (J. Graph Theory, 2016)

Excluding Kuratowski graphs and their duals from binary matroids. - Dillon Mayhew; Gordon F. Royle; Geoff Whittle (J. Comb. Theory B, 2017)

On regular induced subgraphs of generalized polygons. - John Bamberg; Anurag Bishnoi; Gordon F. Royle (J. Comb. Theory A, 2018)

Primitive permutation groups with a suborbit of length 5 and vertex-primitive graphs of valency 5. - Joanna B. Fawcett; Michael Giudici; Cai Heng Li; Cheryl E. Praeger; Gordon F. Royle; Gabriel Verret (J. Comb. Theory A, 2018)

Structure of Cubic Lehman Matrices. - Dillon Mayhew; Irene Pivotto; Gordon F. Royle (Electron. J. Comb., 2019)

Highly-connected planar cubic graphs with few or many Hamilton cycles. - Irene Pivotto; Gordon F. Royle (Discret. Math., 2019)

On the flip graphs on perfect matchings of complete graphs and signed reversal graphs. - Sebastian M. Cioaba; Gordon F. Royle; Zhao Kuang Tan (CoRR, 2020)

Cores of cubelike graphs. - Laura Mancinska; Irene Pivotto; David E. Roberson; Gordon F. Royle (Eur. J. Comb., 2020)

Chromatic roots at 2 and the Beraha number B10. - Daniel J. Harvey; Gordon F. Royle (J. Graph Theory, 2020)

A census of small transitive groups and vertex-transitive graphs. - Derek F. Holt; Gordon F. Royle (J. Symb. Comput., 2020)

The Möbius matroids. - Irene Pivotto; Gordon F. Royle (Adv. Appl. Math., 2021)

Separating rank 3 graphs. - John Bamberg; Michael Giudici; Jesse Lansdown; Gordon F. Royle (Eur. J. Comb., 2023)

Tactical decompositions in finite polar spaces and non-spreading classical group actions. - John Bamberg; Michael Giudici; Jesse Lansdown; Gordon F. Royle (Des. Codes Cryptogr., 2025)