Gordon F. Royle

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 12

Top Topics

Scales Linearly

Series Parallel

Top Venues

J. Comb. Theory, Ser. A

SIAM J. Discret. Math.

J. Graph Theory

Publications

John Bamberg, Michael Giudici, Jesse Lansdown, Gordon F. Royle
Separating rank 3 graphs. Eur. J. Comb. 112 (2023)
Irene Pivotto, Gordon F. Royle
The Möbius matroids. Adv. Appl. Math. 126 (2021)
Derek F. Holt, Gordon F. Royle
A census of small transitive groups and vertex-transitive graphs. J. Symb. Comput. 101 (2020)
Laura Mancinska, Irene Pivotto, David E. Roberson, Gordon F. Royle
Cores of cubelike graphs. Eur. J. Comb. 87 (2020)
Daniel J. Harvey, Gordon F. Royle
. J. Graph Theory 95 (3) (2020)
Sebastian M. Cioaba, Gordon F. Royle, Zhao Kuang Tan
On the flip graphs on perfect matchings of complete graphs and signed reversal graphs. CoRR (2020)
Irene Pivotto, Gordon F. Royle
Highly-connected planar cubic graphs with few or many Hamilton cycles. Discret. Math. 342 (12) (2019)
Dillon Mayhew, Irene Pivotto, Gordon F. Royle
Structure of Cubic Lehman Matrices. Electron. J. Comb. 26 (3) (2019)
Joanna B. Fawcett, Michael Giudici, Cai Heng Li, Cheryl E. Praeger, Gordon F. Royle, Gabriel Verret
Primitive permutation groups with a suborbit of length 5 and vertex-primitive graphs of valency 5. J. Comb. Theory, Ser. A 157 (2018)
John Bamberg, Anurag Bishnoi, Gordon F. Royle
On regular induced subgraphs of generalized polygons. J. Comb. Theory, Ser. A 158 (2018)
Dillon Mayhew, Gordon F. Royle, Geoff Whittle
Excluding Kuratowski graphs and their duals from binary matroids. J. Comb. Theory, Ser. B 125 (2017)
Florian Pfender, Gordon F. Royle
Quartic Graphs with Every Edge in a Triangle. J. Graph Theory 82 (2) (2016)
Gordon F. Royle, Alan D. Sokal
Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs. SIAM J. Discret. Math. 29 (4) (2015)
Joseph P. S. Kung, Dillon Mayhew, Irene Pivotto, Gordon F. Royle
Maximum Size Binary Matroids with no AG(3, 2)-Minor are Graphic. SIAM J. Discret. Math. 28 (3) (2014)
Steven D. Noble, Gordon F. Royle
The Merino-Welsh conjecture holds for series-parallel graphs. Eur. J. Comb. 38 (2014)
John Bamberg, Michael Giudici, Gordon F. Royle
Hemisystems of small flock generalized quadrangles. Des. Codes Cryptogr. 67 (1) (2013)
Dillon Mayhew, Gordon F. Royle
The Internally 4-Connected Binary Matroids with No $M(K_{5}\backslash e)$-Minor. SIAM J. Discret. Math. 26 (2) (2012)
Robert Gray, Dugald Macpherson, Cheryl E. Praeger, Gordon F. Royle
Set-homogeneous directed graphs. J. Comb. Theory, Ser. B 102 (2) (2012)
John Bamberg, Michael Giudici, Joy Morris, Gordon F. Royle, Pablo Spiga
Generalised quadrangles with a group of automorphisms acting primitively on points and lines. J. Comb. Theory, Ser. A 119 (7) (2012)
Feng Ming Dong, Gordon F. Royle, Dave Wagner
Chromatic Roots of a Ring of Four Cliques. Electron. J. Comb. 18 (1) (2011)
Joseph P. S. Kung, Gordon F. Royle
Graphs whose flow polynomials have only integral roots. Eur. J. Comb. 32 (6) (2011)
Gary Haggard, David J. Pearce, Gordon F. Royle
Computing Tutte Polynomials. ACM Trans. Math. Softw. 37 (3) (2010)
David J. Pearce, Gary Haggard, Gordon F. Royle
Edge-Selection Heuristics for Computing Tutte Polynomials. Chic. J. Theor. Comput. Sci. 2010 (2010)
David J. Pearce, Gary Haggard, Gordon F. Royle
Edge-Selection Heuristics for Computing Tutte Polynomials. CATS (2009)
Thomas Britz, Gordon F. Royle, Keisuke Shiromoto
Designs from Matroids. SIAM J. Discret. Math. 23 (2) (2009)
Dillon Mayhew, Gordon F. Royle
Matroids with nine elements. J. Comb. Theory, Ser. B 98 (2) (2008)
Aidan Roy, Gordon F. Royle
The chromatic number and rank of the complements of the Kasami graphs. Discret. Math. 307 (1) (2007)
Koenraad Audenaert, Chris D. Godsil, Gordon F. Royle, Terry Rudolph
Symmetric squares of graphs. J. Comb. Theory, Ser. B 97 (1) (2007)
Gordon F. Royle
Graphs with Chromatic Roots in the Interval (1, 2). Electron. J. Comb. 14 (1) (2007)
Ameera Chowdhury, Chris D. Godsil, Gordon F. Royle
Colouring lines in projective space. J. Comb. Theory, Ser. A 113 (1) (2006)
Gordon F. Royle, Alan D. Sokal
The Brown-Colbourn conjecture on zeros of reliability polynomials is false. J. Comb. Theory, Ser. B 91 (2) (2004)
Matthew R. Brown, Christine M. O'Keefe, Stanley E. Payne, Tim Penttila, Gordon F. Royle
(o), alpha-flocks and Ovals. Des. Codes Cryptogr. 31 (3) (2004)
Gordon F. Royle
The Rank of a Cograph. Electron. J. Comb. 10 (2003)
Gordon F. Royle
Regular vertex diameter critical graphs. Australas. J Comb. 26 (2002)
Chris D. Godsil, Gordon F. Royle
Chromatic Number and the 2-Rank of a Graph. J. Comb. Theory, Ser. B 81 (1) (2001)
Tommy R. Jensen, Gordon F. Royle
Hajós constructions of critical graphs. J. Graph Theory 30 (1) (1999)
Gordon F. Royle
An orderly algorithm and some applications in finite geometry. Discret. Math. 185 (1-3) (1998)
Tim Penttila, Gordon F. Royle
BLT-sets over small fields. Australas. J Comb. 17 (1998)
David Clark, Cara MacNish, Gordon F. Royle
Java as a teaching language - opportunities, pitfalls and solutions. ACSE (1998)
Rowan Davies, Gordon F. Royle
Graph Domination, Tabu Search and the Football Pool Problem. Discret. Appl. Math. 74 (3) (1997)
Donald L. Kreher, Gordon F. Royle, W. D. Wallis
A family of resolvable regular graph designs. Discret. Math. 156 (1-3) (1996)
Tommy R. Jensen, Gordon F. Royle
Small graphs with chromatic number 5: A computer search. J. Graph Theory 19 (1) (1995)
Rudolf Mathon, Gordon F. Royle
The Translation Planes of Order 49. Des. Codes Cryptogr. 5 (1) (1995)
Tim Penttila, Gordon F. Royle
Sets of Type (m, n) in the Affine and Projective Planes of Order Nine. Des. Codes Cryptogr. 6 (3) (1995)
Anthony D. Gardiner, Chris D. Godsil, A. D. Hensel, Gordon F. Royle
Second neighbourhoods of strongly regular graphs. Discret. Math. 103 (2) (1992)
Mark N. Ellingham, Gordon F. Royle
Vertex-switching reconstruction of subgraph numbers and triangle-free graphs. J. Comb. Theory, Ser. B 54 (2) (1992)
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 Cryptogr. 2 (4) (1992)
Yeow Meng Chee, Gordon F. Royle
The 2-rotational Steiner triple systems of order 25. Discret. Math. 97 (1-3) (1991)
Gordon F. Royle
Constructing the vertex-transitive graphs on 24 vertices. SIGSAM Bull. 25 (1) (1991)
P. H. Fisher, Tim Penttila, Cheryl E. Praeger, Gordon F. Royle
Inversive Planes of Odd Order. Eur. J. Comb. 10 (4) (1989)
Gordon F. Royle, Cheryl E. Praeger
Constructing the Vertex-Transitive Graphs of Order 24. J. Symb. Comput. 8 (4) (1989)
Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Gordon F. Royle
An 11-vertex theorem for 3-connected cubic graphs. J. Graph Theory 12 (4) (1988)
P. H. Fisher, Tim Penttila, Gordon F. Royle
Symmetric designs, polarities and sub-designs. Discret. Math. 71 (1) (1988)
Gordon F. Royle
The Transitive Groups of Degree Twelve. J. Symb. Comput. 4 (2) (1987)