default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGordon F. Royle
Person information
- affiliation: University of Western Australia, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j51]John Bamberg
, Michael Giudici, Jesse Lansdown, Gordon F. Royle:
Separating rank 3 graphs. Eur. J. Comb. 112: 103732 (2023)- 2021
- [j50]Irene Pivotto, Gordon F. Royle:
The Möbius matroids. Adv. Appl. Math. 126: 101924 (2021) - 2020
- [j49]Laura Mancinska, Irene Pivotto, David E. Roberson, Gordon F. Royle:
Cores of cubelike graphs. Eur. J. Comb. 87: 103092 (2020) - [j48]Daniel J. Harvey, Gordon F. Royle:
Chromatic roots at 2 and the Beraha number B10. J. Graph Theory 95(3): 445-456 (2020) - [j47]Derek F. Holt, Gordon F. Royle:
A census of small transitive groups and vertex-transitive graphs. J. Symb. Comput. 101: 51-60 (2020) - [i1]Sebastian M. Cioaba, Gordon F. Royle, Zhao Kuang Tan:
On the flip graphs on perfect matchings of complete graphs and signed reversal graphs. CoRR abs/2006.12994 (2020)
2010 – 2019
- 2019
- [j46]Dillon Mayhew, Irene Pivotto, Gordon F. Royle:
Structure of Cubic Lehman Matrices. Electron. J. Comb. 26(3): 3 (2019) - [j45]Irene Pivotto, Gordon F. Royle:
Highly-connected planar cubic graphs with few or many Hamilton cycles. Discret. Math. 342(12) (2019) - 2018
- [j44]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 A 157: 247-266 (2018) - [j43]John Bamberg, Anurag Bishnoi, Gordon F. Royle:
On regular induced subgraphs of generalized polygons. J. Comb. Theory A 158: 254-275 (2018) - 2017
- [j42]Dillon Mayhew, Gordon F. Royle, Geoff Whittle:
Excluding Kuratowski graphs and their duals from binary matroids. J. Comb. Theory B 125: 95-113 (2017) - 2016
- [j41]Florian Pfender, Gordon F. Royle:
Quartic Graphs with Every Edge in a Triangle. J. Graph Theory 82(2): 154-164 (2016) - 2015
- [j40]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): 2117-2159 (2015) - 2014
- [j39]Steven D. Noble, Gordon F. Royle:
The Merino-Welsh conjecture holds for series-parallel graphs. Eur. J. Comb. 38: 24-35 (2014) - [j38]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): 1559-1577 (2014) - 2013
- [j37]John Bamberg, Michael Giudici, Gordon F. Royle:
Hemisystems of small flock generalized quadrangles. Des. Codes Cryptogr. 67(1): 137-157 (2013) - 2012
- [j36]Robert Gray, Dugald Macpherson, Cheryl E. Praeger, Gordon F. Royle:
Set-homogeneous directed graphs. J. Comb. Theory B 102(2): 474-520 (2012) - [j35]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 A 119(7): 1479-1499 (2012) - [j34]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): 755-767 (2012) - 2011
- [j33]Feng Ming Dong, Gordon F. Royle, Dave Wagner:
Chromatic Roots of a Ring of Four Cliques. Electron. J. Comb. 18(1) (2011) - [j32]Joseph P. S. Kung, Gordon F. Royle:
Graphs whose flow polynomials have only integral roots. Eur. J. Comb. 32(6): 831-840 (2011) - 2010
- [j31]David J. Pearce, Gary Haggard, Gordon F. Royle:
Edge-Selection Heuristics for Computing Tutte Polynomials. Chic. J. Theor. Comput. Sci. 2010 (2010) - [j30]Gary Haggard, David J. Pearce, Gordon F. Royle:
Computing Tutte Polynomials. ACM Trans. Math. Softw. 37(3): 24:1-24:17 (2010)
2000 – 2009
- 2009
- [j29]Thomas Britz, Gordon F. Royle, Keisuke Shiromoto:
Designs from Matroids. SIAM J. Discret. Math. 23(2): 1082-1099 (2009) - [c2]David J. Pearce, Gary Haggard, Gordon F. Royle:
Edge-Selection Heuristics for Computing Tutte Polynomials. CATS 2009: 151-159 - 2008
- [j28]Dillon Mayhew, Gordon F. Royle:
Matroids with nine elements. J. Comb. Theory B 98(2): 415-431 (2008) - 2007
- [j27]Gordon F. Royle:
Graphs with Chromatic Roots in the Interval (1, 2). Electron. J. Comb. 14(1) (2007) - [j26]Aidan Roy, Gordon F. Royle:
The chromatic number and rank of the complements of the Kasami graphs. Discret. Math. 307(1): 132-136 (2007) - [j25]Koenraad Audenaert, Chris D. Godsil, Gordon F. Royle, Terry Rudolph:
Symmetric squares of graphs. J. Comb. Theory B 97(1): 74-90 (2007) - 2006
- [j24]Ameera Chowdhury, Chris D. Godsil, Gordon F. Royle:
Colouring lines in projective space. J. Comb. Theory A 113(1): 39-52 (2006) - 2004
- [j23]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 Cryptogr. 31(3): 251-282 (2004) - [j22]Gordon F. Royle, Alan D. Sokal:
The Brown-Colbourn conjecture on zeros of reliability polynomials is false. J. Comb. Theory B 91(2): 345-360 (2004) - 2003
- [j21]Gordon F. Royle:
The Rank of a Cograph. Electron. J. Comb. 10 (2003) - 2002
- [j20]Gordon F. Royle:
Regular vertex diameter critical graphs. Australas. J Comb. 26: 209-218 (2002) - 2001
- [b1]Christopher D. Godsil, Gordon F. Royle:
Algebraic Graph Theory. Graduate texts in mathematics, Springer 2001, ISBN 978-0-387-95220-8, pp. I-XIX, 1-439 - [j19]Chris D. Godsil, Gordon F. Royle:
Chromatic Number and the 2-Rank of a Graph. J. Comb. Theory B 81(1): 142-149 (2001)
1990 – 1999
- 1999
- [j18]Tommy R. Jensen, Gordon F. Royle:
Hajós constructions of critical graphs. J. Graph Theory 30(1): 37-50 (1999) - 1998
- [j17]Tim Penttila, Gordon F. Royle:
BLT-sets over small fields. Australas. J Comb. 17: 295-308 (1998) - [j16]Gordon F. Royle:
An orderly algorithm and some applications in finite geometry. Discret. Math. 185(1-3): 105-115 (1998) - [c1]David Clark, Cara MacNish, Gordon F. Royle:
Java as a teaching language - opportunities, pitfalls and solutions. ACSE 1998: 173-179 - 1997
- [j15]Rowan Davies, Gordon F. Royle:
Graph Domination, Tabu Search and the Football Pool Problem. Discret. Appl. Math. 74(3): 217-228 (1997) - 1996
- [j14]Donald L. Kreher, Gordon F. Royle, W. D. Wallis:
A family of resolvable regular graph designs. Discret. Math. 156(1-3): 269-275 (1996) - 1995
- [j13]Rudolf Mathon, Gordon F. Royle:
The Translation Planes of Order 49. Des. Codes Cryptogr. 5(1): 57-72 (1995) - [j12]Tim Penttila, Gordon F. Royle:
Sets of Type (m, n) in the Affine and Projective Planes of Order Nine. Des. Codes Cryptogr. 6(3): 229-245 (1995) - [j11]Tommy R. Jensen, Gordon F. Royle:
Small graphs with chromatic number 5: A computer search. J. Graph Theory 19(1): 107-116 (1995) - 1992
- [j10]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): 391-394 (1992) - [j9]Anthony D. Gardiner, Chris D. Godsil, A. D. Hensel, Gordon F. Royle:
Second neighbourhoods of strongly regular graphs. Discret. Math. 103(2): 161-170 (1992) - [j8]Mark N. Ellingham, Gordon F. Royle:
Vertex-switching reconstruction of subgraph numbers and triangle-free graphs. J. Comb. Theory B 54(2): 167-177 (1992) - 1991
- [j7]Gordon F. Royle:
Constructing the vertex-transitive graphs on 24 vertices. SIGSAM Bull. 25(1): 56-59 (1991) - [j6]Yeow Meng Chee, Gordon F. Royle:
The 2-rotational Steiner triple systems of order 25. Discret. Math. 97(1-3): 93-100 (1991)
1980 – 1989
- 1989
- [j5]P. H. Fisher, Tim Penttila, Cheryl E. Praeger, Gordon F. Royle:
Inversive Planes of Odd Order. Eur. J. Comb. 10(4): 331-336 (1989) - [j4]Gordon F. Royle, Cheryl E. Praeger:
Constructing the Vertex-Transitive Graphs of Order 24. J. Symb. Comput. 8(4): 309-326 (1989) - 1988
- [j3]P. H. Fisher, Tim Penttila, Gordon F. Royle:
Symmetric designs, polarities and sub-designs. Discret. Math. 71(1): 19-32 (1988) - [j2]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): 561-570 (1988) - 1987
- [j1]Gordon F. Royle:
The Transitive Groups of Degree Twelve. J. Symb. Comput. 4(2): 255-268 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
