Brendan D. McKay

129 papers A* 5A 1B 3Journal 117Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Canonical labelling of random regular graphs.
CoRR
Mikhail Isaev, Tamás Makai, Brendan D. McKay, Pawel Pralat, Jane Tan, Maksim Zhukovskii
2025 J jnl
Cumulant expansion for counting Eulerian orientations.
J. Comb. Theory B
Mikhail Isaev, Brendan D. McKay, Rui-Ray Zhang
2024 J jnl
Generating Plane Quadrangulations and Symmetry-preserving Operations on Maps.
Discret. Math. Theor. Comput. Sci.
Heidi Van den Camp, Brendan D. McKay
2023 J jnl
Degree sequences of sufficiently dense random uniform hypergraphs.
Comb. Probab. Comput.
Catherine S. Greenhill, Mikhail Isaev, Tamás Makai, Brendan D. McKay
2023 J jnl
Factorisation of the complete graph into spanning regular factors.
Adv. Appl. Math.
Mahdieh Hasheminezhad, Brendan D. McKay
2022 J jnl
Asymptotic enumeration of non-uniform linear hypergraphs.
Discuss. Math. Graph Theory
Mahdieh Hasheminezhad, Brendan D. McKay
2022 J jnl
Fast fully dynamic labelling for distance queries.
VLDB J.
Muhammad Farhan, Qing Wang, Yu Lin, Brendan D. McKay
2022 J jnl
Surge: a fast open-source chemical graph generator.
J. Cheminformatics
Brendan D. McKay, Mehmet Aziz Yirik, Christoph Steinbeck
2022 J jnl
The minimality of the Georges-Kelmans graph.
Math. Comput.
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
2021 J jnl
Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs.
Exp. Math.
Noga Alon, Sebastian M. Cioaba, Brandon D. Gilbert, Jack H. Koolen, Brendan D. McKay
2021 J jnl
Subgraph counts for dense random graphs with specified degrees.
Comb. Probab. Comput.
Catherine S. Greenhill, Mikhail Isaev, Brendan D. McKay
2021 J jnl
The Minimality of the Georges-Kelmans Graph.
CoRR
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
2020 J jnl
Asymptotic Enumeration of Orientations of a Graph as a Function of the Out-Degree Sequence.
Electron. J. Comb.
Mikhail Isaev, Tejas Iyer, Brendan D. McKay
2020 J jnl
Asymptotic enumeration of linear hypergraphs with given number of vertices and edges.
Adv. Appl. Math.
Brendan D. McKay, Fang Tian
2020 A* conf
Sandwiching random regular graphs between binomial random graphs.
SODA
Pu Gao, Mikhail Isaev, Brendan D. McKay
2020 A* conf
The Iteration Number of Colour Refinement.
ICALP
Sandra Kiefer, Brendan D. McKay
2020 J jnl
The Iteration Number of Colour Refinement.
CoRR
Sandra Kiefer, Brendan D. McKay
2019 B conf
A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks.
EDBT
Muhammad Farhan, Qing Wang, Yu Lin, Brendan D. McKay
2019 J jnl
The r-switching-stable graphs.
Discret. Appl. Math.
Jeanette C. McLeod, Brendan D. McKay, Beáta Faller
2018 J jnl
A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks.
CoRR
Muhammad Farhan, Qing Wang, Yu Lin, Brendan D. McKay
2018 J jnl
Addressing Johnson graphs, complete multipartite graphs, odd cycles and other graphs.
CoRR
Sebastian M. Cioaba, Brandon D. Gilbert, Jack H. Koolen, Brendan D. McKay
2018 J jnl
Complex martingales and asymptotic enumeration.
Random Struct. Algorithms
Mikhail Isaev, Brendan D. McKay
2018 J jnl
R(5, 5) ≤ 48
J. Graph Theory
Vigleik Angeltveit, Brendan D. McKay
2017 J jnl
Hypohamiltonian Planar Cubic Graphs with Girth 5.
J. Graph Theory
Brendan D. McKay
2017 J jnl
On Ryser's conjecture for linear intersecting multipartite hypergraphs.
Eur. J. Comb.
Nevena Francetic, Sarada Herke, Brendan D. McKay, Ian M. Wanless
2017 J jnl
Planar Hypohamiltonian Graphs on 40 Vertices.
J. Graph Theory
Mohammadreza Jooyandeh, Brendan D. McKay, Patric R. J. Östergård, Ville H. Pettersson, Carol T. Zamfirescu
2017 J jnl
The average number of spanning trees in sparse graphs with given degrees.
Eur. J. Comb.
Catherine S. Greenhill, Mikhail Isaev, Matthew Kwan, Brendan D. McKay
2016 J jnl
Bipartite edge partitions and the former Alon-Saks-Seymour conjecture.
Australas. J Comb.
Zhicheng Gao, Brendan D. McKay, Reza Naserasr, Brett Stevens
2016 — ch.
Graph Isomorphism.
Encyclopedia of Algorithms
Brendan D. McKay
2015 J jnl
A Faster Test for 4-Flow-Criticality in Snarks.
Electron. Notes Discret. Math.
André Breda Carneiro, Cândida Nunes da Silva, Brendan D. McKay
2015 J jnl
Fullerenes with distant pentagons.
CoRR
Jan Goedgebeur, Brendan D. McKay
2015 J jnl
Recursive generation of IPR fullerenes.
CoRR
Jan Goedgebeur, Brendan D. McKay
2014 J jnl
Competition Numbers, Quasi-line Graphs, and Holes.
SIAM J. Discret. Math.
Brendan D. McKay, Pascal Schweitzer, Patrick Schweitzer
2014 J jnl
Practical graph isomorphism, II.
J. Symb. Comput.
Brendan D. McKay, Adolfo Piperno
2014 J jnl
Switching Reconstruction of Digraphs.
J. Graph Theory
Brendan D. McKay, Pascal Schweitzer
2013 J jnl
3-Perfect hamiltonian decomposition of the complete graph.
Australas. J Comb.
Midori Kobayashi, Brendan D. McKay, Nobuaki Mutoh, Gisaku Nakamura, Chie Nara
2013 J jnl
A Note on the History of the Four-Colour Conjecture.
J. Graph Theory
Brendan D. McKay
2013 J jnl
Asymptotic Enumeration of Sparse Multigraphs with Given Degrees.
SIAM J. Discret. Math.
Catherine S. Greenhill, Brendan D. McKay
2013 J jnl
Planar Hypohamiltonian Graphs on 40 Vertices
CoRR
Mohammadreza Jooyandeh, Brendan D. McKay, Patric R. J. Östergård, Ville Pettersson, Carol T. Zamfirescu
2013 J jnl
Practical graph isomorphism, II
CoRR
Brendan D. McKay, Adolfo Piperno
2012 J jnl
The Generation of Fullerenes
CoRR
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
2012 J jnl
The Generation of Fullerenes.
J. Chem. Inf. Model.
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
2011 J jnl
Computational determination of (3, 11) and (4, 7) cages.
J. Discrete Algorithms
Geoffrey Exoo, Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon
2011 J jnl
Generation of Cubic graphs.
Discret. Math. Theor. Comput. Sci.
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
2011 J jnl
Recursive generation of simple planar 5-regular graphs and pentangulations.
J. Graph Algorithms Appl.
Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves
2011 J jnl
Subgraphs of Dense Random Graphs with Specified Degrees.
Comb. Probab. Comput.
Brendan D. McKay
2010 J jnl
Asymptotic enumeration of correlation-immune boolean functions.
Cryptogr. Commun.
E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson
2010 J jnl
Asymptotic enumeration of integer matrices with large equal row and column sums.
Comb.
E. Rodney Canfield, Brendan D. McKay
2010 J jnl
Rectangular-radial drawings of cubic plane graphs.
Comput. Geom.
Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay, Maryam Tahmasbi
2010 J jnl
Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4.
Discuss. Math. Graph Theory
Mahdieh Hasheminezhad, Brendan D. McKay
2009 J jnl
Asymptotic enumeration of correlation-immune boolean functions.
IACR Cryptol. ePrint Arch.
E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson
2009 J jnl
Graph structural properties of non-Yutsis graphs allowing fast recognition.
Discret. Appl. Math.
Robert E. L. Aldred, Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay
2009 J jnl
Random dense bipartite graphs and directed graphs with specified degrees.
Random Struct. Algorithms
Catherine S. Greenhill, Brendan D. McKay
2009 B conf
Recursive Generation of 5-Regular Planar Graphs.
WALCOM
Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves
2009 B conf
Spherical-Rectangular Drawings.
WALCOM
Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay
2009 J jnl
Subgraphs of Random
Comb. Probab. Comput.
Paulette Lieby, Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless
2008 J jnl
A Census of Small Latin Hypercubes.
SIAM J. Discret. Math.
Brendan D. McKay, Ian M. Wanless
2008 J jnl
Asymptotic enumeration of dense 0-1 matrices with specified line sums.
J. Comb. Theory A
E. Rodney Canfield, Catherine S. Greenhill, Brendan D. McKay
2008 J jnl
Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums.
Adv. Appl. Math.
Catherine S. Greenhill, Brendan D. McKay
2008 — ch.
Graph Isomorphism.
Encyclopedia of Algorithms
Brendan D. McKay
2007 J jnl
A generalized switching method for combinatorial estimation.
Australas. J Comb.
Veerle Fack, Brendan D. McKay
2007 A conf
Computing Symmetries of Combinatorial Objects.
GD
Brendan D. McKay
2006 J jnl
A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs.
Discret. Comput. Geom.
Seok-Hee Hong, Brendan D. McKay, Peter Eades
2006 J jnl
Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums.
J. Comb. Theory A
Catherine S. Greenhill, Brendan D. McKay, Xiaoji Wang
2006 J jnl
The number of transversals in a Latin square.
Des. Codes Cryptogr.
Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless
2005 J jnl
Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums.
Electron. J. Comb.
E. Rodney Canfield, Brendan D. McKay
2005 J jnl
Construction of planar triangulations with minimum degree 5.
Discret. Math.
Gunnar Brinkmann, Brendan D. McKay
2005 J jnl
Generation of simple quadrangulations of the sphere.
Discret. Math.
Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan
2005 J jnl
To be or not to be Yutsis: Algorithms for the decision problem.
Comput. Phys. Commun.
Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay
2004 J jnl
Ramsey Numbers for Triangles versus Almost-Complete Graphs.
Ars Comb.
Brendan D. McKay, Konrad Piwakowski, Stanislaw P. Radziszowski
2004 J jnl
Short Cycles in Random Regular Graphs.
Electron. J. Comb.
Brendan D. McKay, Nicholas C. Wormald, Beata Wysocka
2003 J jnl
The asymptotic number of claw-free cubic graphs.
Discret. Math.
Brendan D. McKay, Edgar M. Palmer, Ronald C. Read, Robert W. Robinson
2002 J jnl
Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree.
Comb. Probab. Comput.
Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald
2002 J jnl
Posets on up to 16 Points.
Order
Gunnar Brinkmann, Brendan D. McKay
2002 A* conf
Symmetric drawings of triconnected planar graphs.
SODA
Seok-Hee Hong, Brendan D. McKay, Peter Eades
2002 J jnl
The Distributions of the Entries of Young Tableaux.
J. Comb. Theory A
Brendan D. McKay, Jennifer Morse, Herbert S. Wilf
2001 J jnl
Classification of regular two-graphs on 36 and 38 vertices.
Australas. J Comb.
Brendan D. McKay, Edward Spence
2000 J jnl
Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph.
Random Struct. Algorithms
Zhicheng Gao, Brendan D. McKay, Xiaoji Wang
2000 J jnl
Nonhamiltonian 3-Connected Cubic Planar Graphs.
SIAM J. Discret. Math.
Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay
2000 J jnl
The asymptotic number of graphs with a restriction on the maximum degree.
Electron. Notes Discret. Math.
Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald
2000 J jnl
TrExML: a maximum-likelihood approach for extensive tree-space exploration.
Bioinform.
Marty J. Wolf, Simon Easteal, Margaret Kahn, Brendan D. McKay, Lars S. Jermiin
1999 — conf
An NC Approximation Algorithm for Optimal k -Edge Connectivity Augmentation.
ISPAN
Weifa Liang, Brendan D. McKay
1999 J jnl
Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs.
Graphs Comb.
Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay
1999 J jnl
Fast generation of some classes of planar graphs.
Electron. Notes Discret. Math.
Gunnar Brinkmann, Brendan D. McKay
1999 J jnl
Most Latin Squares Have Many Subsquares.
J. Comb. Theory A
Brendan D. McKay, Ian M. Wanless
1998 J jnl
A Note on Large Graphs of Diameter Two and Given Maximum Degree
J. Comb. Theory B
Brendan D. McKay, Mirka Miller, Jozef Sirán
1998 J jnl
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph.
Comb. Probab. Comput.
Brendan D. McKay, Robert W. Robinson
1998 J jnl
Collective Choice and Mutual Knowledge Structures.
Adv. Complex Syst.
Diana Richards, Brendan D. McKay, Whitman Richards
1998 A* conf
Fast Backtracking Principles Applied to Find New Cages.
SODA
Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon
1998 J jnl
Isomorph-Free Exhaustive Generation.
J. Algorithms
Brendan D. McKay
1998 J jnl
Maximising the Permanent of (0, 1)-Matrices and the Number of Extensions of Latin Rectangles.
Electron. J. Comb.
Brendan D. McKay, Ian M. Wanless
1997 J jnl
Small graphs are reconstructible.
Australas. J Comb.
Brendan D. McKay
1997 J jnl
Subgraph Counting Identities and Ramsey Numbers.
J. Comb. Theory B
Brendan D. McKay, Stanislaw P. Radziszowski
1997 J jnl
The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices.
J. Comb. Theory A
Edward A. Bender, E. Rodney Canfield, Brendan D. McKay
1997 J jnl
The degree sequence of a random graph. I. The models.
Random Struct. Algorithms
Brendan D. McKay, Nicholas C. Wormald
1996 J jnl
Asymptotic Enumeration of Tournaments with a Given Score Sequence.
J. Comb. Theory A
Brendan D. McKay, Xiaoji Wang
1996 J jnl
NC Algorithms for Dynamically Solving the all Pairs Shortest Paths Problem and Related Problems.
Inf. Process. Lett.
Weifa Liang, Brendan D. McKay, Hong Shen
1996 J jnl
Vertex-transitive graphs that are not Cayley graphs. II.
J. Graph Theory
Brendan D. McKay, Cheryl E. Praeger
1995 J jnl
Latin Squares of Order 10.
Electron. J. Comb.
Brendan D. McKay, Eric Rogoyski
1995 J jnl
The Smallest Cubic Graphs of Girth Nine.
Comb. Probab. Comput.
Gunnar Brinkmann, Brendan D. McKay, Carsten Saager
1994 J jnl
Linear Programming in Some Ramsey Problems.
J. Comb. Theory B
Brendan D. McKay, Stanislaw P. Radziszowski
1994 J jnl
Multicolored Trees in Random Graphs.
Random Struct. Algorithms
Alan M. Frieze, Brendan D. McKay
1992 J jnl
A new upper bound on the Ramsey number R(5, 5).
Australas. J Comb.
Brendan D. McKay, Stanislaw P. Radziszowski
1992 J jnl
Asymptotic Properties of Labeled Connected Graphs.
Random Struct. Algorithms
Edward A. Bender, E. Rodney Canfield, Brendan D. McKay
1992 J jnl
On Subgraph Sizes in Random Graphs.
Comb. Probab. Comput.
Neil J. Calkin, Alan M. Frieze, Brendan D. McKay
1992 J jnl
The asymptotic number of labelled weakly-connected digraphs with a given number of vertices and edges.
Australas. J Comb.
Edward A. Bender, E. Rodney Canfield, Brendan D. McKay
1992 J jnl
The value of the Ramsey number
J. Graph Theory
Brendan D. McKay, Ke Min Zhang
1991 J jnl
Asymptotic enumeration by degree sequence of graphs with degress o(n
Comb.
Brendan D. McKay, Nicholas C. Wormald
1991 J jnl
Ralph Gordon Stanton.
Discret. Math.
Brendan D. McKay, Jennifer Seberry, Scott A. Vanstone
1991 A* conf
The First Classical Ramsey Number for Hypergraphs is Computed.
SODA
Brendan D. McKay, Stanislaw P. Radziszowski
1990 J jnl
Asymptotic Enumeration by Degree Sequence of Graphs of High Degree.
Eur. J. Comb.
Brendan D. McKay, Nicholas C. Wormald
1990 J jnl
Asymptotic enumeration of Latin rectangles.
J. Comb. Theory B
Chris D. Godsil, Brendan D. McKay
1990 J jnl
The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges.
Random Struct. Algorithms
Edward A. Bender, E. Rodney Canfield, Brendan D. McKay
1990 J jnl
The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs.
Comb.
Brendan D. McKay
1990 J jnl
Uniform Generation of Random Regular Graphs of Moderate Degree.
J. Algorithms
Brendan D. McKay, Nicholas C. Wormald
1988 J jnl
The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices.
J. Comb. Theory B
Derek A. Holton, Brendan D. McKay
1987 J jnl
Determinants and ranks of random matrices over Z
Discret. Math.
Richard P. Brent, Brendan D. McKay
1986 J jnl
Constant Time Generation of Free Trees.
SIAM J. Comput.
Robert Alan Wright, L. Bruce Richmond, Andrew M. Odlyzko, Brendan D. McKay
1986 J jnl
The number of matchings in random regular graphs and bipartite graphs.
J. Comb. Theory B
Béla Bollobás, Brendan D. McKay
1985 J jnl
Hamiltonian cycles in cubic 3-connected bipartite planar graphs.
J. Comb. Theory B
Derek A. Holton, Bennet Manvel, Brendan D. McKay
1985 J jnl
Integer sequences with proscribed differences and bounded growth rate.
Discret. Math.
Robert L. Hemminger, Brendan D. McKay
1984 J jnl
An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property.
Inf. Process. Lett.
Peter Eades, Brendan D. McKay
1984 J jnl
Automorphisms of random graphs with specified vertices.
Comb.
Brendan D. McKay, Nicholas C. Wormald
1983 J jnl
Spanning Trees in Regular Graphs.
Eur. J. Comb.
Brendan D. McKay
1982 J jnl
A nine point theorem for 3-connected graphs.
Comb.
Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen
1981 J jnl
Spectral conditions for the reconstructibility of a graph.
J. Comb. Theory B
Chris D. Godsil, Brendan D. McKay
1980 J jnl
A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability.
Inf. Process. Lett.
Charles J. Colbourn, Brendan D. McKay
1979 J jnl
Hadamard equivalence via graph isomorphism.
Discret. Math.
Brendan D. McKay
1977 J jnl
Computer reconstruction of small graphs.
J. Graph Theory
Brendan D. McKay