Brendan D. McKay

Brendan D. McKay: A Note on the History of the Four-Colour Conjecture. Journal of Graph Theory 72(3): 361-363 (2013)

Brendan D. McKay, Adolfo Piperno: Practical graph isomorphism, II. CoRR abs/1301.1493 (2013)

Mohammadreza Jooyandeh, Brendan D. McKay, Patric R. J. Östergård, Ville Pettersson, Carol T. Zamfirescu: Planar Hypohamiltonian Graphs on 40 Vertices. CoRR abs/1302.2698 (2013)

Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay: The Generation of Fullerenes. CoRR abs/1207.7010 (2012)

Brendan D. McKay: Subgraphs of Dense Random Graphs with Specified Degrees. Combinatorics, Probability & Computing 20(3): 413-433 (2011)

Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay: Generation of Cubic graphs. Discrete Mathematics & Theoretical Computer Science 13(2): 69-80 (2011)

Geoffrey Exoo, Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon: Computational determination of (3, 11) and (4, 7) cages. J. Discrete Algorithms 9(2): 166-169 (2011)

Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves: Recursive generation of simple planar 5-regular graphs and pentangulations. J. Graph Algorithms Appl. 15(3): 417-436 (2011)

E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson: Asymptotic enumeration of correlation-immune boolean functions. Cryptography and Communications 2(1): 111-126 (2010)

E. Rodney Canfield, Brendan D. McKay: Asymptotic enumeration of integer matrices with large equal row and column sums. Combinatorica 30(6): 655-680 (2010)

Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay, Maryam Tahmasbi: Rectangular-radial drawings of cubic plane graphs. Comput. Geom. 43(9): 767-780 (2010)

Mahdieh Hasheminezhad, Brendan D. McKay: Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4. Discussiones Mathematicae Graph Theory 30(1): 123-136 (2010)

Paulette Lieby, Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless: Subgraphs of Random k-Edge-Coloured k-Regular Graphs. Combinatorics, Probability & Computing 18(4): 533-549 (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. Discrete Applied Mathematics 157(2): 377-386 (2009)

Catherine S. Greenhill, Brendan D. McKay: Random dense bipartite graphs and directed graphs with specified degrees. Random Struct. Algorithms 35(2): 222-249 (2009)

Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves: Recursive Generation of 5-Regular Planar Graphs. WALCOM 2009: 129-140

Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay: Spherical-Rectangular Drawings. WALCOM 2009: 345-356

E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson: Asymptotic enumeration of correlation-immune boolean functions. IACR Cryptology ePrint Archive 2009: 460 (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): 32-66 (2008)

Brendan D. McKay, Ian M. Wanless: A Census of Small Latin Hypercubes. SIAM J. Discrete Math. 22(2): 719-736 (2008)

Brendan D. McKay: Graph Isomorphism. Encyclopedia of Algorithms 2008

Brendan D. McKay: Computing Symmetries of Combinatorial Objects. Graph Drawing 2007: 1

Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless: The number of transversals in a Latin square. Des. Codes Cryptography 40(3): 269-284 (2006)

Seok-Hee Hong, Brendan D. McKay, Peter Eades: A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs. Discrete & Computational Geometry 36(2): 283-311 (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): 291-324 (2006)

E. Rodney Canfield, Brendan D. McKay: Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums. Electr. J. Comb. 12 (2005)

Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay: To be or not to be Yutsis: Algorithms for the decision problem. Computer Physics Communications 173(1-2): 61-70 (2005)

Gunnar Brinkmann, Brendan D. McKay: Construction of planar triangulations with minimum degree 5. Discrete Mathematics 301(2-3): 147-163 (2005)

Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan: Generation of simple quadrangulations of the sphere. Discrete Mathematics 305(1-3): 33-54 (2005)

Brendan D. McKay, Konrad Piwakowski, Stanislaw P. Radziszowski: Ramsey Numbers for Triangles versus Almost-Complete Graphs. Ars Comb. 73 (2004)

Brendan D. McKay, Nicholas C. Wormald, Beata Wysocka: Short Cycles in Random Regular Graphs. Electr. J. Comb. 11(1) (2004)

Brendan D. McKay, Edgar M. Palmer, Ronald C. Read, Robert W. Robinson: The asymptotic number of claw-free cubic graphs. Discrete Mathematics 272(1): 107-118 (2003)

Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald: Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree. Combinatorics, Probability & Computing 11(4): 373-392 (2002)

Brendan D. McKay, Jennifer Morse, Herbert S. Wilf: The Distributions of the Entries of Young Tableaux. J. Comb. Theory, Ser. A 97(1): 117-128 (2002)

Gunnar Brinkmann, Brendan D. McKay: Posets on up to 16 Points. Order 19(2): 147-179 (2002)

Seok-Hee Hong, Brendan D. McKay, Peter Eades: Symmetric drawings of triconnected planar graphs. SODA 2002: 356-365

Marty J. Wolf, Simon Easteal, Margaret Kahn, Brendan D. McKay, Lars S. Jermiin: TrExML: a maximum-likelihood approach for extensive tree-space exploration. Bioinformatics 16(4): 383-394 (2000)

Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald: The asymptotic number of graphs with a restriction on the maximum degree. Electronic Notes in Discrete Mathematics 5: 228-230 (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): 47-57 (2000)

Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay: Nonhamiltonian 3-Connected Cubic Planar Graphs. SIAM J. Discrete Math. 13(1): 25-32 (2000)

Gunnar Brinkmann, Brendan D. McKay: Fast generation of some classes of planar graphs. Electronic Notes in Discrete Mathematics 3: 28-31 (1999)

Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay: Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs. Graphs and Combinatorics 15(4): 373-376 (1999)

Brendan D. McKay, Ian M. Wanless: Most Latin Squares Have Many Subsquares. J. Comb. Theory, Ser. A 86(2): 323-347 (1999)

Weifa Liang, Brendan D. McKay: An NC Approximation Algorithm for Optimal k -Edge Connectivity Augmentation. ISPAN 1999: 290-295

Brendan D. McKay, Ian M. Wanless: Maximising the Permanent of (0, 1)-Matrices and the Number of Extensions of Latin Rectangles. Electr. J. Comb. 5 (1998)

Brendan D. McKay, Robert W. Robinson: Asymptotic Enumeration of Eulerian Circuits in the Complete Graph. Combinatorics, Probability & Computing 7(4): 437-449 (1998)

Brendan D. McKay: Isomorph-Free Exhaustive Generation. J. Algorithms 26(2): 306-324 (1998)

Brendan D. McKay, Mirka Miller, Jozef Sirán: A Note on Large Graphs of Diameter Two and Given Maximum Degree^, . J. Comb. Theory, Ser. B 74(1): 110-118 (1998)

Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon: Fast Backtracking Principles Applied to Find New Cages. SODA 1998: 188-191

Brendan D. McKay, Stanislaw P. Radziszowski: Subgraph Counting Identities and Ramsey Numbers. J. Comb. Theory, Ser. B 69(2): 193-209 (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): 124-150 (1997)

Brendan D. McKay, Nicholas C. Wormald: The degree sequence of a random graph. I. The models. Random Struct. Algorithms 11(2): 97-117 (1997)

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): 149-155 (1996)

Brendan D. McKay, Xiaoji Wang: Asymptotic Enumeration of Tournaments with a Given Score Sequence. J. Comb. Theory, Ser. A 73(1): 77-90 (1996)

Brendan D. McKay, Cheryl E. Praeger: Vertex-transitive graphs that are not Cayley graphs. II. Journal of Graph Theory 22(4): 321-334 (1996)

Brendan D. McKay, Eric Rogoyski: Latin Squares of Order 10. Electr. J. Comb. 2 (1995)

Gunnar Brinkmann, Brendan D. McKay, Carsten Saager: The Smallest Cubic Graphs of Girth Nine. Combinatorics, Probability & Computing 4: 317-329 (1995)

Brendan D. McKay, Stanislaw P. Radziszowski: R(4, 5) = 25. Journal of Graph Theory 19(3): 309-322 (1995)

Brendan D. McKay, Stanislaw P. Radziszowski: Linear Programming in Some Ramsey Problems. J. Comb. Theory, Ser. B 61(1): 125-132 (1994)

Alan M. Frieze, Brendan D. McKay: Multicolored Trees in Random Graphs. Random Struct. Algorithms 5(1): 45-56 (1994)

Neil J. Calkin, Alan M. Frieze, Brendan D. McKay: On Subgraph Sizes in Random Graphs. Combinatorics, Probability & Computing 1: 123-134 (1992)

Brendan D. McKay, Zhang Ke Min: The value of the Ramsey number r(3, 8). Journal of Graph Theory 16(1): 99-105 (1992)

Edward A. Bender, E. Rodney Canfield, Brendan D. McKay: Asymptotic Properties of Labeled Connected Graphs. Random Struct. Algorithms 3(2): 183-202 (1992)

Brendan D. McKay, Nicholas C. Wormald: Asymptotic enumeration by degree sequence of graphs with degress o(n^1/2). Combinatorica 11(4): 369-382 (1991)

Brendan D. McKay, Jennifer Seberry, Scott A. Vanstone: Ralph Gordon Stanton. Discrete Mathematics 92(1-3): 1-8 (1991)

Brendan D. McKay, Stanislaw P. Radziszowski: The First Classical Ramsey Number for Hypergraphs is Computed. SODA 1991: 304-308

Brendan D. McKay: The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs. Combinatorica 10(4): 367-377 (1990)

Brendan D. McKay, Nicholas C. Wormald: Uniform Generation of Random Regular Graphs of Moderate Degree. J. Algorithms 11(1): 52-67 (1990)

Chris D. Godsil, Brendan D. McKay: Asymptotic enumeration of Latin rectangles. J. Comb. Theory, Ser. B 48(1): 19-44 (1990)

Edward A. Bender, E. Rodney Canfield, Brendan D. McKay: The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges. Random Struct. Algorithms 1(2): 127-170 (1990)

Derek A. Holton, Brendan D. McKay: The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices. J. Comb. Theory, Ser. B 45(3): 305-319 (1988)

Richard P. Brent, Brendan D. McKay: Determinants and ranks of random matrices over Z_m. Discrete Mathematics 66(1-2): 35-49 (1987)

Béla Bollobás, Brendan D. McKay: The number of matchings in random regular graphs and bipartite graphs. J. Comb. Theory, Ser. B 41(1): 80-91 (1986)

Robert Alan Wright, L. Bruce Richmond, Andrew M. Odlyzko, Brendan D. McKay: Constant Time Generation of Free Trees. SIAM J. Comput. 15(2): 540-548 (1986)

Robert L. Hemminger, Brendan D. McKay: Integer sequences with proscribed differences and bounded growth rate. Discrete Mathematics 55(3): 255-265 (1985)

Derek A. Holton, Bennet Manvel, Brendan D. McKay: Hamiltonian cycles in cubic 3-connected bipartite planar graphs. J. Comb. Theory, Ser. B 38(3): 279-297 (1985)

Brendan D. McKay, Nicholas C. Wormald: Automorphisms of random graphs with specified vertices. Combinatorica 4(4): 325-338 (1984)

Peter Eades, Brendan D. McKay: An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property. Inf. Process. Lett. 19(3): 131-133 (1984)

Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen: A nine point theorem for 3-connected graphs. Combinatorica 2(1): 53-62 (1982)

Chris D. Godsil, Brendan D. McKay: Spectral conditions for the reconstructibility of a graph. J. Comb. Theory, Ser. B 30(3): 285-289 (1981)

Charles J. Colbourn, Brendan D. McKay: A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability. Inf. Process. Lett. 11(2): 96-97 (1980)