Articole cu mandate pentru acces public - Brendan McKayAflați mai multe
Nu este disponibil nicăieri: 1
Factorisation of the complete graph into spanning regular factors
M Hasheminezhad, BD McKay
Advances in Applied Mathematics 146, 102487, 2023
Mandate: Australian Research Council
Disponibile undeva: 21
Practical graph isomorphism, II
BD McKay, A Piperno
Journal of symbolic computation 60, 94-112, 2014
Mandate: Australian Research Council
The generation of fullerenes
G Brinkmann, J Goedgebeur, BD McKay
Journal of chemical information and modeling 52 (11), 2910-2918, 2012
Mandate: Research Foundation (Flanders)
Generation of cubic graphs
G Brinkmann, J Goedgebeur, BD McKay
Discrete Mathematics & Theoretical Computer Science 13 (Discrete Algorithms), 2011
Mandate: Research Foundation (Flanders)
Complex martingales and asymptotic enumeration
M Isaev, BD McKay
Random Structures & Algorithms 52 (4), 617-661, 2018
Mandate: Australian Research Council
Planar hypohamiltonian graphs on 40 vertices
M Jooyandeh, BD McKay, PRJ Östergård, VH Pettersson, CT Zamfirescu
Journal of Graph Theory 84 (2), 121-133, 2017
Mandate: Australian Research Council, German Research Foundation, Academy of Finland
The average number of spanning trees in sparse graphs with given degrees
C Greenhill, M Isaev, M Kwan, BD McKay
European Journal of Combinatorics 63, 6-25, 2017
Mandate: Australian Research Council
Recursive generation of IPR fullerenes
J Goedgebeur, BD McKay
Journal of Mathematical Chemistry 53 (8), 1702-1724, 2015
Mandate: Australian Research Council, Research Foundation (Flanders)
Asymptotic enumeration of sparse multigraphs with given degrees
C Greenhill, BD McKay
SIAM Journal on Discrete Mathematics 27 (4), 2064-2089, 2013
Mandate: Australian Research Council
The smallest fullerene without a spiral
G Brinkmann, J Goedgebeur, BD McKay
Chemical Physics Letters 522, 54-55, 2012
Mandate: Research Foundation (Flanders)
Sandwiching random regular graphs between binomial random graphs
P Gao, M Isaev, BD McKay
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
Mandate: Natural Sciences and Engineering Research Council of Canada
The order of automorphisms of quasigroups
BD McKay, IM Wanless, X Zhang
Journal of Combinatorial Designs 23 (7), 275-288, 2015
Mandate: Australian Research Council, National Natural Science Foundation of China
Competition numbers, quasi-line graphs, and holes
BD McKay, P Schweitzer, P Schweitzer
SIAM Journal on Discrete Mathematics 28 (1), 77-91, 2014
Mandate: Australian Research Council
Asymptotic enumeration of linear hypergraphs with given number of vertices and edges
BD McKay, F Tian
Advances in Applied Mathematics 115, 102000, 2020
Mandate: National Natural Science Foundation of China
Sandwiching dense random regular graphs between binomial random graphs
P Gao, M Isaev, BD McKay
Probability Theory and Related Fields 184 (1-2), 115-158, 2022
Mandate: Australian Research Council, Natural Sciences and Engineering Research …
The minimality of the Georges–Kelmans graph
G Brinkmann, J Goedgebeur, B McKay
Mathematics of Computation 91 (335), 1483-1500, 2022
Mandate: Research Foundation (Flanders)
Subgraph counts for dense random graphs with specified degrees
C Greenhill, M Isaev, BD McKay
Combinatorics, Probability and Computing 30 (3), 460-497, 2021
Mandate: Australian Research Council
Enumeration of Latin squares with conjugate symmetry
BD McKay, IM Wanless
Journal of Combinatorial Designs 30 (2), 105-130, 2022
Mandate: Australian Research Council
Addressing Johnson graphs, complete multipartite graphs, odd cycles and other graphs.
SM Cioaba, BD Gilbert, JH Koolen, BD McKay
CoRR, 2018
Mandate: US National Science Foundation, Chinese Academy of Sciences, National …
Switching reconstruction of digraphs
BD McKay, P Schweitzer
Journal of Graph Theory 76 (4), 279-296, 2014
Mandate: Australian Research Council, European Commission
Informațiile despre publicații și finanțare sunt alese automat de un program informatic