Gordon F. Royle

57 papers Journal 54Unranked 2

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