Gordon F. Royle

Orcid: 0000-0003-2669-4437

Affiliations:

University of Western Australia, Australia

According to our database¹, Gordon F. Royle authored at least 54 papers between 1987 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2023

Separating rank 3 graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., August, 2023

2021

The Möbius matroids.

[BibT_eX]

[DOI]

Irene Pivotto

Gordon F. Royle

Adv. Appl. Math., 2021

2020

A census of small transitive groups and vertex-transitive graphs.

[BibT_eX]

[DOI]

Derek F. Holt

Gordon F. Royle

J. Symb. Comput., 2020

Chromatic roots at 2 and the Beraha number B<sub>10</sub>.

[BibT_eX]

[DOI]

Daniel J. Harvey

Gordon F. Royle

J. Graph Theory, 2020

Cores of cubelike graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

On the flip graphs on perfect matchings of complete graphs and signed reversal graphs.

[BibT_eX]

[DOI]

Sebastian M. Cioaba

Gordon F. Royle

Zhao Kuang Tan

CoRR, 2020

2019

Highly-connected planar cubic graphs with few or many Hamilton cycles.

[BibT_eX]

[DOI]

Irene Pivotto

Gordon F. Royle

Discret. Math., 2019

Structure of Cubic Lehman Matrices.

[BibT_eX]

[DOI]

Dillon Mayhew

Irene Pivotto

Gordon F. Royle

Electron. J. Comb., 2019

2018

Primitive permutation groups with a suborbit of length 5 and vertex-primitive graphs of valency 5.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2018

On regular induced subgraphs of generalized polygons.

[BibT_eX]

[DOI]

John Bamberg

Anurag Bishnoi

Gordon F. Royle

J. Comb. Theory A, 2018

2017

Excluding Kuratowski graphs and their duals from binary matroids.

[BibT_eX]

[DOI]

Dillon Mayhew

Gordon F. Royle

Geoff Whittle

J. Comb. Theory B, 2017

2016

Quartic Graphs with Every Edge in a Triangle.

[BibT_eX]

[DOI]

Florian Pfender

Gordon F. Royle

J. Graph Theory, 2016

2015

Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs.

[BibT_eX]

[DOI]

Gordon F. Royle

Alan D. Sokal

SIAM J. Discret. Math., 2015

2014

Maximum Size Binary Matroids with no AG(3, 2)-Minor are Graphic.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

The Merino-Welsh conjecture holds for series-parallel graphs.

[BibT_eX]

[DOI]

Steven D. Noble

Gordon F. Royle

Eur. J. Comb., 2014

2013

Hemisystems of small flock generalized quadrangles.

[BibT_eX]

[DOI]

John Bamberg

Michael Giudici

Gordon F. Royle

Des. Codes Cryptogr., 2013

2012

The Internally 4-Connected Binary Matroids with No $M(K_{5}\backslash e)$-Minor.

[BibT_eX]

[DOI]

Dillon Mayhew

Gordon F. Royle

SIAM J. Discret. Math., 2012

Set-homogeneous directed graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

Generalised quadrangles with a group of automorphisms acting primitively on points and lines.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2012

2011

Graphs whose flow polynomials have only integral roots.

[BibT_eX]

[DOI]

Joseph P. S. Kung

Gordon F. Royle

Eur. J. Comb., 2011

Chromatic Roots of a Ring of Four Cliques.

[BibT_eX]

[DOI]

Feng Ming Dong

Gordon F. Royle

Dave Wagner

Electron. J. Comb., 2011

2010

Computing Tutte Polynomials.

[BibT_eX]

[DOI]

Gary Haggard

David J. Pearce

Gordon F. Royle

ACM Trans. Math. Softw., 2010

Edge-Selection Heuristics for Computing Tutte Polynomials.

[BibT_eX]

[DOI]

David J. Pearce

Gary Haggard

Gordon F. Royle

Chic. J. Theor. Comput. Sci., 2010

2009

Designs from Matroids.

[BibT_eX]

[DOI]

Thomas Britz

Gordon F. Royle

Keisuke Shiromoto

SIAM J. Discret. Math., 2009

2008

Matroids with nine elements.

[BibT_eX]

[DOI]

Dillon Mayhew

Gordon F. Royle

J. Comb. Theory B, 2008

2007

Symmetric squares of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

The chromatic number and rank of the complements of the Kasami graphs.

[BibT_eX]

[DOI]

Aidan Roy

Gordon F. Royle

Discret. Math., 2007

Graphs with Chromatic Roots in the Interval (1, 2).

[BibT_eX]

[DOI]

Gordon F. Royle

Electron. J. Comb., 2007

2006

Colouring lines in projective space.

[BibT_eX]

[DOI]

Ameera Chowdhury

Chris D. Godsil

Gordon F. Royle

J. Comb. Theory A, 2006

2004

The Brown-Colbourn conjecture on zeros of reliability polynomials is false.

[BibT_eX]

[DOI]

Gordon F. Royle

Alan D. Sokal

J. Comb. Theory B, 2004

Spreads of T<sub>2</sub>(o), alpha-flocks and Ovals.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2004

2003

The Rank of a Cograph.

[BibT_eX]

[DOI]

Gordon F. Royle

Electron. J. Comb., 2003

2002

Regular vertex diameter critical graphs.

[BibT_eX]

[DOI]

Gordon F. Royle

Australas. J Comb., 2002

2001

Chromatic Number and the 2-Rank of a Graph.

[BibT_eX]

[DOI]

Chris D. Godsil

Gordon F. Royle

J. Comb. Theory B, 2001

Algebraic Graph Theory.

[BibT_eX]

[DOI]

Christopher D. Godsil

Gordon F. Royle

Graduate texts in mathematics, Springer, ISBN: 978-0-387-95220-8, 2001

1999

Hajós constructions of critical graphs.

[BibT_eX]

[DOI]

Tommy R. Jensen

Gordon F. Royle

J. Graph Theory, 1999

1998

An orderly algorithm and some applications in finite geometry.

[BibT_eX]

[DOI]

Gordon F. Royle

Discret. Math., 1998

BLT-sets over small fields.

[BibT_eX]

[DOI]

Tim Penttila

Gordon F. Royle

Australas. J Comb., 1998

Java as a teaching language - opportunities, pitfalls and solutions.

[BibT_eX]

[DOI]

David Clark

Cara MacNish

Gordon F. Royle

Proceedings of the ACM SIGCSE 3rd Australasian Conference on Computer Science Education, 1998

1997

Graph Domination, Tabu Search and the Football Pool Problem.

[BibT_eX]

[DOI]

Rowan Davies

Gordon F. Royle

Discret. Appl. Math., 1997

1996

A family of resolvable regular graph designs.

[BibT_eX]

[DOI]

Donald L. Kreher

Gordon F. Royle

W. D. Wallis

Discret. Math., 1996

1995

Small graphs with chromatic number 5: A computer search.

[BibT_eX]

[DOI]

Tommy R. Jensen

Gordon F. Royle

J. Graph Theory, 1995

Sets of Type (m, n) in the Affine and Projective Planes of Order Nine.

[BibT_eX]

[DOI]

Tim Penttila

Gordon F. Royle

Des. Codes Cryptogr., 1995

The Translation Planes of Order 49.

[BibT_eX]

[DOI]

Rudolf Mathon

Gordon F. Royle

Des. Codes Cryptogr., 1995

1992

Vertex-switching reconstruction of subgraph numbers and triangle-free graphs.

[BibT_eX]

[DOI]

Mark N. Ellingham

Gordon F. Royle

J. Comb. Theory B, 1992

Second neighbourhoods of strongly regular graphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

On the p-Rank of Incidence Matrices and a Bound of Bruen and Ott.

[BibT_eX]

[DOI]

D. de Caen

Chris D. Godsil

Gordon F. Royle

Des. Codes Cryptogr., 1992

1991

The 2-rotational Steiner triple systems of order 25.

[BibT_eX]

[DOI]

Yeow Meng Chee

Gordon F. Royle

Discret. Math., 1991

Constructing the vertex-transitive graphs on 24 vertices.

[BibT_eX]

[DOI]

Gordon F. Royle

SIGSAM Bull., 1991

1989

Constructing the Vertex-Transitive Graphs of Order 24.

[BibT_eX]

[DOI]

Gordon F. Royle

Cheryl E. Praeger

J. Symb. Comput., 1989

Inversive Planes of Odd Order.

[BibT_eX]

[DOI]

Eur. J. Comb., 1989

1988

An 11-vertex theorem for 3-connected cubic graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1988

Symmetric designs, polarities and sub-designs.

[BibT_eX]

[DOI]

P. H. Fisher

Tim Penttila

Gordon F. Royle

Discret. Math., 1988

1987

The Transitive Groups of Degree Twelve.

[BibT_eX]

[DOI]

Gordon F. Royle

J. Symb. Comput., 1987

Gordon F. Royle

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...