| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay |
Generation of Cubic graphs.  |
Discrete Mathematics & Theoretical Computer Science  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Brendan D. McKay |
Subgraphs of Dense Random Graphs with Specified Degrees. |
Combinatorics, Probability & Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves |
Recursive generation of simple planar 5-regular graphs and pentangulations. |
J. Graph Algorithms Appl. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Geoffrey Exoo, Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon |
Computational determination of (3, 11) and (4, 7) cages. |
J. Discrete Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson |
Asymptotic enumeration of correlation-immune boolean functions. |
Cryptography and Communications |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | E. Rodney Canfield, Brendan D. McKay |
Asymptotic enumeration of integer matrices with large equal row and column sums. |
Combinatorica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahdieh Hasheminezhad, Brendan D. McKay |
Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4. |
Discussiones Mathematicae Graph Theory |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay, Maryam Tahmasbi |
Rectangular-radial drawings of cubic plane graphs. |
Comput. Geom. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Catherine S. Greenhill, Brendan D. McKay |
Random dense bipartite graphs and directed graphs with specified degrees. |
Random Struct. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Paulette Lieby, Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless |
Subgraphs of Random k-Edge-Coloured k-Regular Graphs. |
Combinatorics, Probability & Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves |
Recursive Generation of 5-Regular Planar Graphs. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
pentangulation, quintic, 5-regular, 5-valent, graph, map, planar |
| 1 | Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay |
Spherical-Rectangular Drawings. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Ian M. Wanless |
A Census of Small Latin Hypercubes. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay |
Graph Isomorphism. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay |
Computing Symmetries of Combinatorial Objects. |
Graph Drawing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless |
The number of transversals in a Latin square. |
Des. Codes Cryptography |
2006 |
DBLP DOI BibTeX RDF |
AMS Classification 05B15 |
| 1 | Gunnar Brinkmann, Brendan D. McKay |
Construction of planar triangulations with minimum degree 5. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan |
Generation of simple quadrangulations of the sphere. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | E. Rodney Canfield, Brendan D. McKay |
Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums. |
Electr. J. Comb. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Brendan D. McKay, Nicholas C. Wormald, Beata Wysocka |
Short Cycles in Random Regular Graphs. |
Electr. J. Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Brendan D. McKay, Konrad Piwakowski, Stanislaw P. Radziszowski |
Ramsey Numbers for Triangles versus Almost-Complete Graphs. |
Ars Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Brendan D. McKay, Edgar M. Palmer, Ronald C. Read, Robert W. Robinson |
The asymptotic number of claw-free cubic graphs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Jennifer Morse, Herbert S. Wilf |
The Distributions of the Entries of Young Tableaux. |
J. Comb. Theory, Ser. A |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gunnar Brinkmann, Brendan D. McKay |
Posets on up to 16 Points. |
Order |
2002 |
DBLP DOI BibTeX RDF |
canonical construction path, algorithm, enumeration, poset |
| 1 | Seok-Hee Hong, Brendan D. McKay, Peter Eades |
Symmetric drawings of triconnected planar graphs. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Marty J. Wolf, Simon Easteal, Margaret Kahn, Brendan D. McKay, Lars S. Jermiin |
TrExML: a maximum-likelihood approach for extensive tree-space exploration. |
Bioinformatics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhicheng Gao, Brendan D. McKay, Xiaoji Wang |
Asymptotic enumeration of tournaments with a given score sequence containing a specified digraph. |
Random Struct. Algorithms |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, S. Bau, Derek A. Holton, Brendan D. McKay |
Nonhamiltonian 3-Connected Cubic Planar Graphs. |
SIAM J. Discrete Math. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Ian M. Wanless |
Most Latin Squares Have Many Subsquares. |
J. Comb. Theory, Ser. A |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gunnar Brinkmann, Brendan D. McKay |
Fast generation of some classes of planar graphs. |
Electronic Notes in Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, S. Bau, Derek A. Holton, Brendan D. McKay |
Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs. |
Graphs and Combinatorics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifa Liang, Brendan D. McKay |
An NC Approximation Algorithm for Optimal k -Edge Connectivity Augmentation. |
ISPAN |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Ian M. Wanless |
Maximising the Permanent of (0, 1)-Matrices and the Number of Extensions of Latin Rectangles. |
Electr. J. Comb. |
1998 |
DBLP BibTeX RDF |
|
| 1 | Brendan D. McKay, Robert W. Robinson |
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph. |
Combinatorics, Probability & Computing |
1998 |
DBLP BibTeX RDF |
|
| 1 | Brendan D. McKay |
Isomorph-Free Exhaustive Generation. |
J. Algorithms |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon |
Fast Backtracking Principles Applied to Find New Cages. |
SODA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Stanislaw P. Radziszowski |
Subgraph Counting Identities and Ramsey Numbers. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Nicholas C. Wormald |
The degree sequence of a random graph. I. The models. |
Random Struct. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Xiaoji Wang |
Asymptotic Enumeration of Tournaments with a Given Score Sequence. |
J. Comb. Theory, Ser. A |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Weifa Liang, Brendan D. McKay, Hong Shen |
NC Algorithms for Dynamically Solving the all Pairs Shortest Paths Problem and Related Problems. |
Inf. Process. Lett. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Eric Rogoyski |
Latin Squares of Order 10. |
Electr. J. Comb. |
1995 |
DBLP BibTeX RDF |
|
| 1 | Gunnar Brinkmann, Brendan D. McKay, Carsten Saager |
The Smallest Cubic Graphs of Girth Nine. |
Combinatorics, Probability & Computing |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Stanislaw P. Radziszowski |
Linear Programming in Some Ramsey Problems. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Brendan D. McKay |
Multicolored Trees in Random Graphs. |
Random Struct. Algorithms |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Edward A. Bender, E. Rodney Canfield, Brendan D. McKay |
Asymptotic Properties of Labeled Connected Graphs. |
Random Struct. Algorithms |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil J. Calkin, Alan M. Frieze, Brendan D. McKay |
On Subgraph Sizes in Random Graphs. |
Combinatorics, Probability & Computing |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Jennifer Seberry, Scott A. Vanstone |
Ralph Gordon Stanton. |
Discrete Mathematics |
1991 |
DBLP BibTeX RDF |
|
| 1 | Brendan D. McKay, Nicholas C. Wormald |
Asymptotic enumeration by degree sequence of graphs with degress o(n1/2). |
Combinatorica |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Stanislaw P. Radziszowski |
The First Classical Ramsey Number for Hypergraphs is Computed. |
SODA |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris D. Godsil, Brendan D. McKay |
Asymptotic enumeration of Latin rectangles. |
J. Comb. Theory, Ser. B |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Nicholas C. Wormald |
Uniform Generation of Random Regular Graphs of Moderate Degree. |
J. Algorithms |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay |
The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs. |
Combinatorica |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek A. Holton, Brendan D. McKay |
The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices. |
J. Comb. Theory, Ser. B |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard P. Brent, Brendan D. McKay |
Determinants and ranks of random matrices over Zm. |
Discrete Mathematics |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Brendan D. McKay |
The number of matchings in random regular graphs and bipartite graphs. |
J. Comb. Theory, Ser. B |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Alan Wright, L. Bruce Richmond, Andrew M. Odlyzko, Brendan D. McKay |
Constant Time Generation of Free Trees. |
SIAM J. Comput. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek A. Holton, Bennet Manvel, Brendan D. McKay |
Hamiltonian cycles in cubic 3-connected bipartite planar graphs. |
J. Comb. Theory, Ser. B |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert L. Hemminger, Brendan D. McKay |
Integer sequences with proscribed differences and bounded growth rate. |
Discrete Mathematics |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Eades, Brendan D. McKay |
An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property. |
Inf. Process. Lett. |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Brendan D. McKay, Nicholas C. Wormald |
Automorphisms of random graphs with specified vertices. |
Combinatorica |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek A. Holton, Brendan D. McKay, Michael D. Plummer, Carsten Thomassen |
A nine point theorem for 3-connected graphs. |
Combinatorica |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris D. Godsil, Brendan D. McKay |
Spectral conditions for the reconstructibility of a graph. |
J. Comb. Theory, Ser. B |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Charles J. Colbourn, Brendan D. McKay |
A Correction to Colbourn's Paper on the Complexity of Matrix Symmetrizability. |
Inf. Process. Lett. |
1980 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")