Brendan D. McKay

According to our database1, Brendan D. McKay authored at least 112 papers between 1977 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 





Asymptotic Enumeration of Orientations of a Graph as a Function of the Out-Degree Sequence.
Electron. J. Comb., 2020

Asymptotic enumeration of linear hypergraphs with given number of vertices and edges.
Adv. Appl. Math., 2020

Sandwiching random regular graphs between binomial random graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

The Iteration Number of Colour Refinement.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

The r-switching-stable graphs.
Discret. Appl. Math., 2019

A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks.
Proceedings of the Advances in Database Technology, 2019

Complex martingales and asymptotic enumeration.
Random Struct. Algorithms, 2018

R(5, 5) ≤ 48
Journal of Graph Theory, 2018

Addressing Johnson graphs, complete multipartite graphs, odd cycles and other graphs.
CoRR, 2018

Hypohamiltonian Planar Cubic Graphs with Girth 5.
Journal of Graph Theory, 2017

Planar Hypohamiltonian Graphs on 40 Vertices.
Journal of Graph Theory, 2017

The average number of spanning trees in sparse graphs with given degrees.
Eur. J. Comb., 2017

On Ryser's conjecture for linear intersecting multipartite hypergraphs.
Eur. J. Comb., 2017

Graph Isomorphism.
Encyclopedia of Algorithms, 2016

Bipartite edge partitions and the former Alon-Saks-Seymour conjecture.
Australas. J Comb., 2016

A Faster Test for 4-Flow-Criticality in Snarks.
Electron. Notes Discret. Math., 2015

Fullerenes with distant pentagons.
CoRR, 2015

Recursive generation of IPR fullerenes.
CoRR, 2015

Competition Numbers, Quasi-line Graphs, and Holes.
SIAM J. Discret. Math., 2014

Practical graph isomorphism, II.
J. Symb. Comput., 2014

Switching Reconstruction of Digraphs.
Journal of Graph Theory, 2014

Asymptotic Enumeration of Sparse Multigraphs with Given Degrees.
SIAM J. Discret. Math., 2013

A Note on the History of the Four-Colour Conjecture.
Journal of Graph Theory, 2013

3-Perfect hamiltonian decomposition of the complete graph.
Australas. J Comb., 2013

The Generation of Fullerenes.
J. Chem. Inf. Model., 2012

Recursive generation of simple planar 5-regular graphs and pentangulations.
J. Graph Algorithms Appl., 2011

Computational determination of (3, 11) and (4, 7) cages.
J. Discrete Algorithms, 2011

Generation of Cubic graphs.
Discret. Math. Theor. Comput. Sci., 2011

Subgraphs of Dense Random Graphs with Specified Degrees.
Comb. Probab. Comput., 2011

Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4.
Discuss. Math. Graph Theory, 2010

Rectangular-radial drawings of cubic plane graphs.
Comput. Geom., 2010

Asymptotic enumeration of integer matrices with large equal row and column sums.
Comb., 2010

Asymptotic enumeration of correlation-immune boolean functions.
Cryptogr. Commun., 2010

Random dense bipartite graphs and directed graphs with specified degrees.
Random Struct. Algorithms, 2009

Graph structural properties of non-Yutsis graphs allowing fast recognition.
Discret. Appl. Math., 2009

Subgraphs of Random <i>k</i>-Edge-Coloured <i>k</i>-Regular Graphs.
Comb. Probab. Comput., 2009

Recursive Generation of 5-Regular Planar Graphs.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Spherical-Rectangular Drawings.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Graph Isomorphism.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

A Census of Small Latin Hypercubes.
SIAM J. Discret. Math., 2008

Asymptotic enumeration of dense 0-1 matrices with specified line sums.
J. Comb. Theory, Ser. A, 2008

Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums.
Adv. Appl. Math., 2008

A generalized switching method for combinatorial estimation.
Australas. J Comb., 2007

Computing Symmetries of Combinatorial Objects.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums.
J. Comb. Theory, Ser. A, 2006

A Linear Time Algorithm for Constructing Maximally Symmetric Straight Line Drawings of Triconnected Planar Graphs.
Discret. Comput. Geom., 2006

The number of transversals in a Latin square.
Des. Codes Cryptogr., 2006

Construction of planar triangulations with minimum degree 5.
Discret. Math., 2005

Generation of simple quadrangulations of the sphere.
Discret. Math., 2005

To be or not to be Yutsis: Algorithms for the decision problem.
Comput. Phys. Commun., 2005

Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums.
Electron. J. Comb., 2005

Short Cycles in Random Regular Graphs.
Electron. J. Comb., 2004

Ramsey Numbers for Triangles versus Almost-Complete Graphs.
Ars Comb., 2004

The asymptotic number of claw-free cubic graphs.
Discret. Math., 2003

Posets on up to 16 Points.
Order, 2002

The Distributions of the Entries of Young Tableaux.
J. Comb. Theory, Ser. A, 2002

Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree.
Comb. Probab. Comput., 2002

Symmetric drawings of triconnected planar graphs.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Classification of regular two-graphs on 36 and 38 vertices.
Australas. J Comb., 2001

Nonhamiltonian 3-Connected Cubic Planar Graphs.
SIAM J. Discret. Math., 2000

Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph.
Random Struct. Algorithms, 2000

The asymptotic number of graphs with a restriction on the maximum degree.
Electron. Notes Discret. Math., 2000

TrExML: a maximum-likelihood approach for extensive tree-space exploration.
Bioinform., 2000

Most Latin Squares Have Many Subsquares.
J. Comb. Theory, Ser. A, 1999

Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs.
Graphs Comb., 1999

Fast generation of some classes of planar graphs.
Electron. Notes Discret. Math., 1999

An NC Approximation Algorithm for Optimal k -Edge Connectivity Augmentation.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

A Note on Large Graphs of Diameter Two and Given Maximum Degree<sup>, </sup>.
J. Comb. Theory, Ser. B, 1998

Isomorph-Free Exhaustive Generation.
J. Algorithms, 1998

Asymptotic Enumeration of Eulerian Circuits in the Complete Graph.
Comb. Probab. Comput., 1998

Maximising the Permanent of (0, 1)-Matrices and the Number of Extensions of Latin Rectangles.
Electron. J. Comb., 1998

Collective Choice and Mutual Knowledge Structures.
Advances in Complex Systems, 1998

Fast Backtracking Principles Applied to Find New Cages.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

The degree sequence of a random graph. I. The models.
Random Struct. Algorithms, 1997

Subgraph Counting Identities and Ramsey Numbers.
J. Comb. Theory, Ser. B, 1997

The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices.
J. Comb. Theory, Ser. A, 1997

Small graphs are reconstructible.
Australas. J Comb., 1997

Vertex-transitive graphs that are not Cayley graphs. II.
Journal of Graph Theory, 1996

Asymptotic Enumeration of Tournaments with a Given Score Sequence.
J. Comb. Theory, Ser. A, 1996

NC Algorithms for Dynamically Solving the all Pairs Shortest Paths Problem and Related Problems.
Inf. Process. Lett., 1996

<i>R</i>(4, 5) = 25.
Journal of Graph Theory, 1995

The Smallest Cubic Graphs of Girth Nine.
Comb. Probab. Comput., 1995

Latin Squares of Order 10.
Electron. J. Comb., 1995

Multicolored Trees in Random Graphs.
Random Struct. Algorithms, 1994

Linear Programming in Some Ramsey Problems.
J. Comb. Theory, Ser. B, 1994

Asymptotic Properties of Labeled Connected Graphs.
Random Struct. Algorithms, 1992

The value of the Ramsey number <i>r</i>(3, 8).
Journal of Graph Theory, 1992

On Subgraph Sizes in Random Graphs.
Comb. Probab. Comput., 1992

A new upper bound on the Ramsey number R(5, 5).
Australas. J Comb., 1992

The asymptotic number of labelled weakly-connected digraphs with a given number of vertices and edges.
Australas. J Comb., 1992

Ralph Gordon Stanton.
Discret. Math., 1991

Asymptotic enumeration by degree sequence of graphs with degress o(n<sup>1/2</sup>).
Comb., 1991

The First Classical Ramsey Number for Hypergraphs is Computed.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges.
Random Struct. Algorithms, 1990

Asymptotic enumeration of Latin rectangles.
J. Comb. Theory, Ser. B, 1990

Uniform Generation of Random Regular Graphs of Moderate Degree.
J. Algorithms, 1990

Asymptotic Enumeration by Degree Sequence of Graphs of High Degree.
Eur. J. Comb., 1990

The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs.
Comb., 1990

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices.
J. Comb. Theory, Ser. B, 1988

Determinants and ranks of random matrices over Z<sub>m</sub>.
Discret. Math., 1987

Constant Time Generation of Free Trees.
SIAM J. Comput., 1986

The number of matchings in random regular graphs and bipartite graphs.
J. Comb. Theory, Ser. B, 1986

Hamiltonian cycles in cubic 3-connected bipartite planar graphs.
J. Comb. Theory, Ser. B, 1985

Integer sequences with proscribed differences and bounded growth rate.
Discret. Math., 1985

An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property.
Inf. Process. Lett., 1984

Automorphisms of random graphs with specified vertices.
Comb., 1984

Spanning Trees in Regular Graphs.
Eur. J. Comb., 1983

A nine point theorem for 3-connected graphs.
Comb., 1982

Spectral conditions for the reconstructibility of a graph.
J. Comb. Theory, Ser. B, 1981

A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability.
Inf. Process. Lett., 1980

Hadamard equivalence via graph isomorphism.
Discret. Math., 1979

Computer reconstruction of small graphs.
Journal of Graph Theory, 1977