default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBrendan D. McKay
Person information
- affiliation: Australian National University, Canberra, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j105]Mahdieh Hasheminezhad, Brendan D. McKay:
Factorisation of the complete graph into spanning regular factors. Adv. Appl. Math. 146: 102487 (2023)- [j104]Catherine S. Greenhill
, Mikhail Isaev, Tamás Makai, Brendan D. McKay:
Degree sequences of sufficiently dense random uniform hypergraphs. Comb. Probab. Comput. 32(2): 183-224 (2023) - 2022
- [j103]Mahdieh Hasheminezhad, Brendan D. McKay:
Asymptotic enumeration of non-uniform linear hypergraphs. Discuss. Math. Graph Theory 42(1): 219-230 (2022) - [j102]Brendan D. McKay, Mehmet Aziz Yirik, Christoph Steinbeck:
Surge: a fast open-source chemical graph generator. J. Cheminformatics 14(1): 24 (2022) - [j101]Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay:
The minimality of the Georges-Kelmans graph. Math. Comput. 91(335): 1483-1500 (2022) - [j100]Muhammad Farhan, Qing Wang, Yu Lin, Brendan D. McKay:
Fast fully dynamic labelling for distance queries. VLDB J. 31(3): 483-506 (2022) - 2021
- [j99]Catherine S. Greenhill, Mikhail Isaev, Brendan D. McKay:
Subgraph counts for dense random graphs with specified degrees. Comb. Probab. Comput. 30(3): 460-497 (2021) - [j98]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): 372-382 (2021) - [i10]Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay:
The Minimality of the Georges-Kelmans Graph. CoRR abs/2101.00943 (2021) - 2020
- [j97]Brendan D. McKay, Fang Tian:
Asymptotic enumeration of linear hypergraphs with given number of vertices and edges. Adv. Appl. Math. 115 (2020) - [j96]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): 1 (2020) - [c10]Sandra Kiefer, Brendan D. McKay:
The Iteration Number of Colour Refinement. ICALP 2020: 73:1-73:19 - [c9]Pu Gao, Mikhail Isaev, Brendan D. McKay:
Sandwiching random regular graphs between binomial random graphs. SODA 2020: 690-701 - [i9]Sandra Kiefer, Brendan D. McKay:
The Iteration Number of Colour Refinement. CoRR abs/2005.10182 (2020)
2010 – 2019
- 2019
- [j95]Jeanette C. McLeod, Brendan D. McKay, Beáta Faller:
The r-switching-stable graphs. Discret. Appl. Math. 266: 16-29 (2019) - [c8]Muhammad Farhan, Qing Wang, Yu Lin, Brendan D. McKay:
A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks. EDBT 2019: 13-24 - 2018
- [j94]Vigleik Angeltveit, Brendan D. McKay:
R(5, 5) ≤ 48. J. Graph Theory 89(1): 5-13 (2018) - [j93]Mikhail Isaev, Brendan D. McKay:
Complex martingales and asymptotic enumeration. Random Struct. Algorithms 52(4): 617-661 (2018) - [i8]Sebastian M. Cioaba, Brandon D. Gilbert, Jack H. Koolen, Brendan D. McKay:
Addressing Johnson graphs, complete multipartite graphs, odd cycles and other graphs. CoRR abs/1808.04757 (2018) - [i7]Muhammad Farhan, Qing Wang, Yu Lin, Brendan D. McKay:
A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks. CoRR abs/1812.02363 (2018) - 2017
- [j92]Nevena Francetic, Sarada Herke, Brendan D. McKay, Ian M. Wanless:
On Ryser's conjecture for linear intersecting multipartite hypergraphs. Eur. J. Comb. 61: 91-105 (2017) - [j91]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: 6-25 (2017) - [j90]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): 121-133 (2017) - [j89]Brendan D. McKay:
Hypohamiltonian Planar Cubic Graphs with Girth 5. J. Graph Theory 85(1): 7-11 (2017) - 2016
- [j88]Zhicheng Gao, Brendan D. McKay, Reza Naserasr, Brett Stevens:
Bipartite edge partitions and the former Alon-Saks-Seymour conjecture. Australas. J Comb. 66: 211-228 (2016) - [r2]Brendan D. McKay:
Graph Isomorphism. Encyclopedia of Algorithms 2016: 875-879 - 2015
- [j87]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: 193-198 (2015) - [i6]Jan Goedgebeur, Brendan D. McKay:
Recursive generation of IPR fullerenes. CoRR abs/1501.02680 (2015) - [i5]Jan Goedgebeur, Brendan D. McKay:
Fullerenes with distant pentagons. CoRR abs/1508.02878 (2015) - 2014
- [j86]Brendan D. McKay, Pascal Schweitzer:
Switching Reconstruction of Digraphs. J. Graph Theory 76(4): 279-296 (2014) - [j85]Brendan D. McKay, Adolfo Piperno:
Practical graph isomorphism, II. J. Symb. Comput. 60: 94-112 (2014) - [j84]Brendan D. McKay, Pascal Schweitzer, Patrick Schweitzer:
Competition Numbers, Quasi-line Graphs, and Holes. SIAM J. Discret. Math. 28(1): 77-91 (2014) - 2013
- [j83]Midori Kobayashi, Brendan D. McKay, Nobuaki Mutoh, Gisaku Nakamura, Chie Nara:
3-Perfect hamiltonian decomposition of the complete graph. Australas. J Comb. 56: 219-224 (2013) - [j82]Brendan D. McKay:
A Note on the History of the Four-Colour Conjecture. J. Graph Theory 72(3): 361-363 (2013) - [j81]Catherine S. Greenhill, Brendan D. McKay:
Asymptotic Enumeration of Sparse Multigraphs with Given Degrees. SIAM J. Discret. Math. 27(4): 2064-2089 (2013) - [i4]Brendan D. McKay, Adolfo Piperno:
Practical graph isomorphism, II. CoRR abs/1301.1493 (2013) - [i3]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) - 2012
- [j80]Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay:
The Generation of Fullerenes. J. Chem. Inf. Model. 52(11): 2910-2918 (2012) - [i2]Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay:
The Generation of Fullerenes. CoRR abs/1207.7010 (2012) - 2011
- [j79]Brendan D. McKay:
Subgraphs of Dense Random Graphs with Specified Degrees. Comb. Probab. Comput. 20(3): 413-433 (2011) - [j78]Gunnar Brinkmann, Jan Goedgebeur, Brendan D. McKay:
Generation of Cubic graphs. Discret. Math. Theor. Comput. Sci. 13(2): 69-80 (2011) - [j77]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) - [j76]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) - 2010
- [j75]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): 111-126 (2010) - [j74]E. Rodney Canfield, Brendan D. McKay:
Asymptotic enumeration of integer matrices with large equal row and column sums. Comb. 30(6): 655-680 (2010) - [j73]Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay, Maryam Tahmasbi:
Rectangular-radial drawings of cubic plane graphs. Comput. Geom. 43(9): 767-780 (2010) - [j72]Mahdieh Hasheminezhad, Brendan D. McKay:
Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4. Discuss. Math. Graph Theory 30(1): 123-136 (2010)
2000 – 2009
- 2009
- [j71]Paulette Lieby, Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless:
Subgraphs of Random k-Edge-Coloured k-Regular Graphs. Comb. Probab. Comput. 18(4): 533-549 (2009) - [j70]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): 377-386 (2009) - [j69]Catherine S. Greenhill, Brendan D. McKay:
Random dense bipartite graphs and directed graphs with specified degrees. Random Struct. Algorithms 35(2): 222-249 (2009) - [c7]Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves:
Recursive Generation of 5-Regular Planar Graphs. WALCOM 2009: 129-140 - [c6]Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay:
Spherical-Rectangular Drawings. WALCOM 2009: 345-356 - [i1]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: 460 (2009) - 2008
- [j68]Catherine S. Greenhill, Brendan D. McKay:
Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums. Adv. Appl. Math. 41(4): 459-481 (2008) - [j67]E. Rodney Canfield, Catherine S. Greenhill, Brendan D. McKay:
Asymptotic enumeration of dense 0-1 matrices with specified line sums. J. Comb. Theory A 115(1): 32-66 (2008) - [j66]Brendan D. McKay, Ian M. Wanless:
A Census of Small Latin Hypercubes. SIAM J. Discret. Math. 22(2): 719-736 (2008) - [r1]Brendan D. McKay:
Graph Isomorphism. Encyclopedia of Algorithms 2008 - 2007
- [j65]Veerle Fack, Brendan D. McKay:
A generalized switching method for combinatorial estimation. Australas. J Comb. 39: 141-154 (2007) - [c5]Brendan D. McKay:
Computing Symmetries of Combinatorial Objects. GD 2007: 1 - 2006
- [j64]Brendan D. McKay, Jeanette C. McLeod, Ian M. Wanless:
The number of transversals in a Latin square. Des. Codes Cryptogr. 40(3): 269-284 (2006) - [j63]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): 283-311 (2006) - [j62]Catherine S. Greenhill, Brendan D. McKay, Xiaoji Wang:
Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums. J. Comb. Theory A 113(2): 291-324 (2006) - 2005
- [j61]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) - [j60]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): 61-70 (2005) - [j59]Gunnar Brinkmann, Brendan D. McKay:
Construction of planar triangulations with minimum degree 5. Discret. Math. 301(2-3): 147-163 (2005) - [j58]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): 33-54 (2005) - 2004
- [j57]Brendan D. McKay, Konrad Piwakowski, Stanislaw P. Radziszowski:
Ramsey Numbers for Triangles versus Almost-Complete Graphs. Ars Comb. 73 (2004) - [j56]Brendan D. McKay, Nicholas C. Wormald, Beata Wysocka:
Short Cycles in Random Regular Graphs. Electron. J. Comb. 11(1) (2004) - 2003
- [j55]Brendan D. McKay, Edgar M. Palmer, Ronald C. Read, Robert W. Robinson:
The asymptotic number of claw-free cubic graphs. Discret. Math. 272(1): 107-118 (2003) - 2002
- [j54]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): 373-392 (2002) - [j53]Brendan D. McKay, Jennifer Morse, Herbert S. Wilf:
The Distributions of the Entries of Young Tableaux. J. Comb. Theory A 97(1): 117-128 (2002) - [j52]Gunnar Brinkmann, Brendan D. McKay:
Posets on up to 16 Points. Order 19(2): 147-179 (2002) - [c4]Seok-Hee Hong, Brendan D. McKay, Peter Eades:
Symmetric drawings of triconnected planar graphs. SODA 2002: 356-365 - 2001
- [j51]Brendan D. McKay, Edward Spence:
Classification of regular two-graphs on 36 and 38 vertices. Australas. J Comb. 24: 293-300 (2001) - 2000
- [j50]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): 383-394 (2000) - [j49]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: 228-230 (2000) - [j48]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) - [j47]Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay:
Nonhamiltonian 3-Connected Cubic Planar Graphs. SIAM J. Discret. Math. 13(1): 25-32 (2000)
1990 – 1999
- 1999
- [j46]Gunnar Brinkmann, Brendan D. McKay:
Fast generation of some classes of planar graphs. Electron. Notes Discret. Math. 3: 28-31 (1999) - [j45]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): 373-376 (1999) - [j44]Brendan D. McKay, Ian M. Wanless:
Most Latin Squares Have Many Subsquares. J. Comb. Theory A 86(2): 323-347 (1999) - [c3]Weifa Liang, Brendan D. McKay:
An NC Approximation Algorithm for Optimal k -Edge Connectivity Augmentation. ISPAN 1999: 290-295 - 1998
- [j43]Diana Richards, Brendan D. McKay, Whitman Richards:
Collective Choice and Mutual Knowledge Structures. Adv. Complex Syst. 1(2-3): 221-236 (1998) - [j42]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) - [j41]Brendan D. McKay, Robert W. Robinson:
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph. Comb. Probab. Comput. 7(4): 437-449 (1998) - [j40]Brendan D. McKay:
Isomorph-Free Exhaustive Generation. J. Algorithms 26(2): 306-324 (1998) - [j39]Brendan D. McKay, Mirka Miller, Jozef Sirán:
A Note on Large Graphs of Diameter Two and Given Maximum Degree, . J. Comb. Theory B 74(1): 110-118 (1998) - [c2]Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon:
Fast Backtracking Principles Applied to Find New Cages. SODA 1998: 188-191 - 1997
- [j38]Brendan D. McKay:
Small graphs are reconstructible. Australas. J Comb. 15: 123-126 (1997) - [j37]Brendan D. McKay, Stanislaw P. Radziszowski:
Subgraph Counting Identities and Ramsey Numbers. J. Comb. Theory B 69(2): 193-209 (1997) - [j36]Edward A. Bender, E. Rodney Canfield, Brendan D. McKay:
The Asymptotic Number of Labeled Graphs withnVertices, qEdges, and No Isolated Vertices. J. Comb. Theory A 80(1): 124-150 (1997) - [j35]Brendan D. McKay, Nicholas C. Wormald:
The degree sequence of a random graph. I. The models. Random Struct. Algorithms 11(2): 97-117 (1997) - 1996
- [j34]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) - [j33]Brendan D. McKay, Xiaoji Wang:
Asymptotic Enumeration of Tournaments with a Given Score Sequence. J. Comb. Theory A 73(1): 77-90 (1996) - [j32]Brendan D. McKay, Cheryl E. Praeger:
Vertex-transitive graphs that are not Cayley graphs. II. J. Graph Theory 22(4): 321-334 (1996) - 1995
- [j31]Brendan D. McKay, Eric Rogoyski:
Latin Squares of Order 10. Electron. J. Comb. 2 (1995) - [j30]Gunnar Brinkmann, Brendan D. McKay, Carsten Saager:
The Smallest Cubic Graphs of Girth Nine. Comb. Probab. Comput. 4: 317-329 (1995) - [j29]Brendan D. McKay, Stanislaw P. Radziszowski:
R(4, 5) = 25. J. Graph Theory 19(3): 309-322 (1995) - 1994
- [j28]Brendan D. McKay, Stanislaw P. Radziszowski:
Linear Programming in Some Ramsey Problems. J. Comb. Theory B 61(1): 125-132 (1994) - [j27]Alan M. Frieze, Brendan D. McKay:
Multicolored Trees in Random Graphs. Random Struct. Algorithms 5(1): 45-56 (1994) - 1992
- [j26]Brendan D. McKay, Stanislaw P. Radziszowski:
A new upper bound on the Ramsey number R(5, 5). Australas. J Comb. 5: 13-20 (1992) - [j25]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: 119-124 (1992) - [j24]Neil J. Calkin, Alan M. Frieze, Brendan D. McKay:
On Subgraph Sizes in Random Graphs. Comb. Probab. Comput. 1: 123-134 (1992) - [j23]Brendan D. McKay, Zhang Ke Min:
The value of the Ramsey number r(3, 8). J. Graph Theory 16(1): 99-105 (1992) - [j22]Edward A. Bender, E. Rodney Canfield, Brendan D. McKay:
Asymptotic Properties of Labeled Connected Graphs. Random Struct. Algorithms 3(2): 183-202 (1992) - 1991
- [j21]Brendan D. McKay, Nicholas C. Wormald:
Asymptotic enumeration by degree sequence of graphs with degress o(n1/2). Comb. 11(4): 369-382 (1991) - [j20]Brendan D. McKay, Jennifer Seberry, Scott A. Vanstone:
Ralph Gordon Stanton. Discret. Math. 92(1-3): 1-8 (1991) - [c1]Brendan D. McKay, Stanislaw P. Radziszowski:
The First Classical Ramsey Number for Hypergraphs is Computed. SODA 1991: 304-308 - 1990
- [j19]Brendan D. McKay:
The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs. Comb. 10(4): 367-377 (1990) - [j18]Brendan D. McKay, Nicholas C. Wormald:
Asymptotic Enumeration by Degree Sequence of Graphs of High Degree. Eur. J. Comb. 11(6): 565-580 (1990) - [j17]Brendan D. McKay, Nicholas C. Wormald:
Uniform Generation of Random Regular Graphs of Moderate Degree. J. Algorithms 11(1): 52-67 (1990) - [j16]Chris D. Godsil, Brendan D. McKay:
Asymptotic enumeration of Latin rectangles. J. Comb. Theory B 48(1): 19-44 (1990) - [j15]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)
1980 – 1989
- 1988
- [j14]Derek A. Holton, Brendan D. McKay:
The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices. J. Comb. Theory B 45(3): 305-319 (1988) - 1987
- [j13]Richard P. Brent, Brendan D. McKay:
Determinants and ranks of random matrices over Zm. Discret. Math. 66(1-2): 35-49 (1987) - 1986
- [j12]Béla Bollobás, Brendan D. McKay:
The number of matchings in random regular graphs and bipartite graphs. J. Comb. Theory B 41(1): 80-91 (1986) - [j11]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) - 1985
- [j10]Robert L. Hemminger, Brendan D. McKay:
Integer sequences with proscribed differences and bounded growth rate. Discret. Math. 55(3): 255-265 (1985) - [j9]Derek A. Holton, Bennet Manvel, Brendan D. McKay:
Hamiltonian cycles in cubic 3-connected bipartite planar graphs. J. Comb. Theory B 38(3): 279-297 (1985) - 1984
- [j8]