Brendan D. McKay

ORCID

Publication Activity (10 Years)

Years Active: 1977-2023
Publications (10 Years): 25

Top Venues

CoRR

J. Graph Theory

Comb. Probab. Comput.

Adv. Appl. Math.

Publications

Catherine S. Greenhill, Mikhail Isaev, Tamás Makai, Brendan D. McKay
Degree sequences of sufficiently dense random uniform hypergraphs. Comb. Probab. Comput. 32 (2) (2023)
Mahdieh Hasheminezhad, Brendan D. McKay
Factorisation of the complete graph into spanning regular factors. Adv. Appl. Math. 146 (2023)
Muhammad Farhan, Qing Wang, Yu Lin, Brendan D. McKay
Fast fully dynamic labelling for distance queries. VLDB J. 31 (3) (2022)
Mahdieh Hasheminezhad, Brendan D. McKay
Asymptotic enumeration of non-uniform linear hypergraphs. Discuss. Math. Graph Theory 42 (1) (2022)
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
The minimality of the Georges-Kelmans graph. Math. Comput. 91 (335) (2022)
Brendan D. McKay, Mehmet Aziz Yirik, Christoph Steinbeck
Surge: a fast open-source chemical graph generator. J. Cheminformatics 14 (1) (2022)
Catherine S. Greenhill, Mikhail Isaev, Brendan D. McKay
Subgraph counts for dense random graphs with specified degrees. Comb. Probab. Comput. 30 (3) (2021)
Noga Alon, Sebastian M. Cioaba, Brandon D. Gilbert, Jack H. Koolen, Brendan D. McKay
Addressing Johnson Graphs, Complete Multipartite Graphs, Odd Cycles, and Random Graphs. Exp. Math. 30 (3) (2021)
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
The Minimality of the Georges-Kelmans Graph. CoRR (2021)
Brendan D. McKay, Fang Tian
Asymptotic enumeration of linear hypergraphs with given number of vertices and edges. Adv. Appl. Math. 115 (2020)
Sandra Kiefer, Brendan D. McKay
The Iteration Number of Colour Refinement. ICALP (2020)
Mikhail Isaev, Tejas Iyer, Brendan D. McKay
Asymptotic Enumeration of Orientations of a Graph as a Function of the Out-Degree Sequence. Electron. J. Comb. 27 (1) (2020)
Sandra Kiefer, Brendan D. McKay
The Iteration Number of Colour Refinement. CoRR (2020)
Pu Gao, Mikhail Isaev, Brendan D. McKay
Sandwiching random regular graphs between binomial random graphs. SODA (2020)
Jeanette C. McLeod, Brendan D. McKay, Beáta Faller
The r-switching-stable graphs. Discret. Appl. Math. 266 (2019)
Muhammad Farhan, Qing Wang, Yu Lin, Brendan D. McKay
A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks. EDBT (2019)
Mikhail Isaev, Brendan D. McKay
Complex martingales and asymptotic enumeration. Random Struct. Algorithms 52 (4) (2018)
Vigleik Angeltveit, Brendan D. McKay
R(5, 5) ≤ 48 J. Graph Theory 89 (1) (2018)
Muhammad Farhan, Qing Wang, Yu Lin, Brendan D. McKay
A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks. CoRR (2018)
Sebastian M. Cioaba, Brandon D. Gilbert, Jack H. Koolen, Brendan D. McKay
Addressing Johnson graphs, complete multipartite graphs, odd cycles and other graphs. CoRR (2018)
Nevena Francetic, Sarada Herke, Brendan D. McKay, Ian M. Wanless
On Ryser's conjecture for linear intersecting multipartite hypergraphs. Eur. J. Comb. 61 (2017)
Mohammadreza Jooyandeh, Brendan D. McKay, Patric R. J. Östergård, Ville H. Pettersson, Carol T. Zamfirescu
Planar Hypohamiltonian Graphs on 40 Vertices. J. Graph Theory 84 (2) (2017)
Brendan D. McKay
Hypohamiltonian Planar Cubic Graphs with Girth 5. J. Graph Theory 85 (1) (2017)
Catherine S. Greenhill, Mikhail Isaev, Matthew Kwan, Brendan D. McKay
The average number of spanning trees in sparse graphs with given degrees. Eur. J. Comb. 63 (2017)
Zhicheng Gao, Brendan D. McKay, Reza Naserasr, Brett Stevens
Bipartite edge partitions and the former Alon-Saks-Seymour conjecture. Australas. J Comb. 66 (2016)
Jan Goedgebeur, Brendan D. McKay
Recursive generation of IPR fullerenes. CoRR (2015)
Jan Goedgebeur, Brendan D. McKay
Fullerenes with distant pentagons. CoRR (2015)
André Breda Carneiro, Cândida Nunes da Silva, Brendan D. McKay
A Faster Test for 4-Flow-Criticality in Snarks. Electron. Notes Discret. Math. 50 (2015)
Brendan D. McKay, Adolfo Piperno
Practical graph isomorphism, II. J. Symb. Comput. 60 (2014)
Brendan D. McKay, Pascal Schweitzer
Switching Reconstruction of Digraphs. J. Graph Theory 76 (4) (2014)
Brendan D. McKay, Pascal Schweitzer, Patrick Schweitzer
Competition Numbers, Quasi-line Graphs, and Holes. SIAM J. Discret. Math. 28 (1) (2014)
Mohammadreza Jooyandeh, Brendan D. McKay, Patric R. J. Östergård, Ville Pettersson, Carol T. Zamfirescu
Planar Hypohamiltonian Graphs on 40 Vertices CoRR (2013)
Brendan D. McKay
A Note on the History of the Four-Colour Conjecture. J. Graph Theory 72 (3) (2013)
Midori Kobayashi, Brendan D. McKay, Nobuaki Mutoh, Gisaku Nakamura, Chie Nara
3-Perfect hamiltonian decomposition of the complete graph. Australas. J Comb. 56 (2013)
Catherine S. Greenhill, Brendan D. McKay
Asymptotic Enumeration of Sparse Multigraphs with Given Degrees. SIAM J. Discret. Math. 27 (4) (2013)
Brendan D. McKay, Adolfo Piperno
Practical graph isomorphism, II CoRR (2013)
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
The Generation of Fullerenes CoRR (2012)
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
The Generation of Fullerenes. J. Chem. Inf. Model. 52 (11) (2012)
Geoffrey Exoo, Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon
Computational determination of (3, 11) and (4, 7) cages. J. Discrete Algorithms 9 (2) (2011)
Brendan D. McKay
Subgraphs of Dense Random Graphs with Specified Degrees. Comb. Probab. Comput. 20 (3) (2011)
Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay
Generation of Cubic graphs. Discret. Math. Theor. Comput. Sci. 13 (2) (2011)
Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves
Recursive generation of simple planar 5-regular graphs and pentangulations. J. Graph Algorithms Appl. 15 (3) (2011)
E. Rodney Canfield, Brendan D. McKay
Asymptotic enumeration of integer matrices with large equal row and column sums. Comb. 30 (6) (2010)
Mahdieh Hasheminezhad, Brendan D. McKay
Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4. Discuss. Math. Graph Theory 30 (1) (2010)
E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson
Asymptotic enumeration of correlation-immune boolean functions. Cryptogr. Commun. 2 (1) (2010)
Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay, Maryam Tahmasbi
Rectangular-radial drawings of cubic plane graphs. Comput. Geom. 43 (9) (2010)
Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves
Recursive Generation of 5-Regular Planar Graphs. WALCOM (2009)
Robert E. L. Aldred, Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay
Graph structural properties of non-Yutsis graphs allowing fast recognition. Discret. Appl. Math. 157 (2) (2009)
Catherine S. Greenhill, Brendan D. McKay
Random dense bipartite graphs and directed graphs with specified degrees. Random Struct. Algorithms 35 (2) (2009)
Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay
Spherical-Rectangular Drawings. WALCOM (2009)
E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson
Asymptotic enumeration of correlation-immune boolean functions. IACR Cryptol. ePrint Arch. 2009 (2009)
Paulette Lieby, Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless
-Regular Graphs. Comb. Probab. Comput. 18 (4) (2009)
E. Rodney Canfield, Catherine S. Greenhill, Brendan D. McKay
Asymptotic enumeration of dense 0-1 matrices with specified line sums. J. Comb. Theory, Ser. A 115 (1) (2008)
Catherine S. Greenhill, Brendan D. McKay
Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums. Adv. Appl. Math. 41 (4) (2008)
Brendan D. McKay, Ian M. Wanless
A Census of Small Latin Hypercubes. SIAM J. Discret. Math. 22 (2) (2008)
Veerle Fack, Brendan D. McKay
A generalized switching method for combinatorial estimation. Australas. J Comb. 39 (2007)
Brendan D. McKay
Computing Symmetries of Combinatorial Objects. Graph Drawing (2007)
Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless
The number of transversals in a Latin square. Des. Codes Cryptogr. 40 (3) (2006)
Catherine S. Greenhill, Brendan D. McKay, Xiaoji Wang
Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums. J. Comb. Theory, Ser. A 113 (2) (2006)
Seok-Hee Hong, Brendan D. McKay, Peter Eades
A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs. Discret. Comput. Geom. 36 (2) (2006)
E. Rodney Canfield, Brendan D. McKay
Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums. Electron. J. Comb. 12 (2005)
Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan
Generation of simple quadrangulations of the sphere. Discret. Math. 305 (1-3) (2005)
Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay
To be or not to be Yutsis: Algorithms for the decision problem. Comput. Phys. Commun. 173 (1-2) (2005)
Gunnar Brinkmann, Brendan D. McKay
Construction of planar triangulations with minimum degree 5. Discret. Math. 301 (2-3) (2005)
Brendan D. McKay, Nicholas C. Wormald, Beata Wysocka
Short Cycles in Random Regular Graphs. Electron. J. Comb. 11 (1) (2004)
Brendan D. McKay, Konrad Piwakowski, Stanislaw P. Radziszowski
Ramsey Numbers for Triangles versus Almost-Complete Graphs. Ars Comb. 73 (2004)
Brendan D. McKay, Edgar M. Palmer, Ronald C. Read, Robert W. Robinson
The asymptotic number of claw-free cubic graphs. Discret. Math. 272 (1) (2003)
Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald
Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree. Comb. Probab. Comput. 11 (4) (2002)
Gunnar Brinkmann, Brendan D. McKay
Posets on up to 16 Points. Order 19 (2) (2002)
Seok-Hee Hong, Brendan D. McKay, Peter Eades
Symmetric drawings of triconnected planar graphs. SODA (2002)
Brendan D. McKay, Jennifer Morse, Herbert S. Wilf
The Distributions of the Entries of Young Tableaux. J. Comb. Theory, Ser. A 97 (1) (2002)
Brendan D. McKay, Edward Spence
Classification of regular two-graphs on 36 and 38 vertices. Australas. J Comb. 24 (2001)
Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay
Nonhamiltonian 3-Connected Cubic Planar Graphs. SIAM J. Discret. Math. 13 (1) (2000)
Marty J. Wolf, Simon Easteal, Margaret Kahn, Brendan D. McKay, Lars S. Jermiin
TrExML: a maximum-likelihood approach for extensive tree-space exploration. Bioinform. 16 (4) (2000)
Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald
The asymptotic number of graphs with a restriction on the maximum degree. Electron. Notes Discret. Math. 5 (2000)
Zhicheng Gao, Brendan D. McKay, Xiaoji Wang
Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph. Random Struct. Algorithms 16 (1) (2000)
Gunnar Brinkmann, Brendan D. McKay
Fast generation of some classes of planar graphs. Electron. Notes Discret. Math. 3 (1999)
Brendan D. McKay, Ian M. Wanless
Most Latin Squares Have Many Subsquares. J. Comb. Theory, Ser. A 86 (2) (1999)
Weifa Liang, Brendan D. McKay
An NC Approximation Algorithm for Optimal k -Edge Connectivity Augmentation. ISPAN (1999)
Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay
Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs. Graphs Comb. 15 (4) (1999)
Brendan D. McKay
Isomorph-Free Exhaustive Generation. J. Algorithms 26 (2) (1998)
Brendan D. McKay, Ian M. Wanless
Maximising the Permanent of (0, 1)-Matrices and the Number of Extensions of Latin Rectangles. Electron. J. Comb. 5 (1998)
Diana Richards, Brendan D. McKay, Whitman Richards
Collective Choice and Mutual Knowledge Structures. Adv. Complex Syst. 1 (2-3) (1998)
Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon
Fast Backtracking Principles Applied to Find New Cages. SODA (1998)
Brendan D. McKay, Mirka Miller, Jozef Sirán
. J. Comb. Theory, Ser. B 74 (1) (1998)
Brendan D. McKay, Robert W. Robinson
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph. Comb. Probab. Comput. 7 (4) (1998)
Brendan D. McKay, Nicholas C. Wormald
The degree sequence of a random graph. I. The models. Random Struct. Algorithms 11 (2) (1997)
Brendan D. McKay
Small graphs are reconstructible. Australas. J Comb. 15 (1997)
Edward A. Bender, E. Rodney Canfield, Brendan D. McKay
The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices. J. Comb. Theory, Ser. A 80 (1) (1997)
Brendan D. McKay, Stanislaw P. Radziszowski
Subgraph Counting Identities and Ramsey Numbers. J. Comb. Theory, Ser. B 69 (2) (1997)
Brendan D. McKay, Xiaoji Wang
Asymptotic Enumeration of Tournaments with a Given Score Sequence. J. Comb. Theory, Ser. A 73 (1) (1996)
Brendan D. McKay, Cheryl E. Praeger
Vertex-transitive graphs that are not Cayley graphs. II. J. Graph Theory 22 (4) (1996)
Weifa Liang, Brendan D. McKay, Hong Shen
NC Algorithms for Dynamically Solving the all Pairs Shortest Paths Problem and Related Problems. Inf. Process. Lett. 58 (3) (1996)
Gunnar Brinkmann, Brendan D. McKay, Carsten Saager
The Smallest Cubic Graphs of Girth Nine. Comb. Probab. Comput. 4 (1995)
Brendan D. McKay, Stanislaw P. Radziszowski
(4, 5) = 25. J. Graph Theory 19 (3) (1995)
Brendan D. McKay, Eric Rogoyski
Latin Squares of Order 10. Electron. J. Comb. 2 (1995)
Alan M. Frieze, Brendan D. McKay
Multicolored Trees in Random Graphs. Random Struct. Algorithms 5 (1) (1994)
Brendan D. McKay, Stanislaw P. Radziszowski
Linear Programming in Some Ramsey Problems. J. Comb. Theory, Ser. B 61 (1) (1994)
Brendan D. McKay, Zhang Ke Min
(3, 8). J. Graph Theory 16 (1) (1992)
Edward A. Bender, E. Rodney Canfield, Brendan D. McKay
The asymptotic number of labelled weakly-connected digraphs with a given number of vertices and edges. Australas. J Comb. 6 (1992)

Brendan D. McKay.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Brendan D. McKay