The following pages link to Brendan D. McKay (Q168496):
Displaying 50 items.
- Asymptotic enumeration by degree sequence of graphs of high degree (Q1814088) (← links)
- The probability of collective choice with shared knowledge structures (Q1867359) (← links)
- Latin squares of order 10 (Q1897685) (← links)
- Asymptotic enumeration of tournaments with a given score sequence (Q1906120) (← links)
- Asymptotic enumeration of integer matrices with large equal row and column sums (Q1945291) (← links)
- Cycles through 23 vertices in 3-connected cubic planar graphs (Q1961756) (← links)
- The \(r\)-switching-stable graphs (Q2026314) (← links)
- Asymptotic enumeration of non-uniform linear hypergraphs (Q2062682) (← links)
- Sandwiching dense random regular graphs between binomial random graphs (Q2089753) (← links)
- Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence (Q2290353) (← links)
- Asymptotic enumeration of linear hypergraphs with given number of vertices and edges (Q2300585) (← links)
- The average number of spanning trees in sparse graphs with given degrees (Q2357218) (← links)
- Asymptotic enumeration of correlation-immune Boolean functions (Q2380852) (← links)
- Practical graph isomorphism. II. (Q2437295) (← links)
- Asymptotic enumeration of dense 0-1 matrices with specified line sums (Q2469197) (← links)
- A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs (Q2505225) (← links)
- On the number of Latin squares (Q2571023) (← links)
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums (Q2571271) (← links)
- Generation of simple quadrangulations of the sphere (Q2581402) (← links)
- Construction of planar triangulations with minimum degree 5 (Q2581624) (← links)
- Factorisation of the complete graph into spanning regular factors (Q2689165) (← links)
- Fast generation of some classes of planar graphs (Q2741325) (← links)
- Classification of regular two-graphs on 36 and 38 vertices (Q2760451) (← links)
- The asymptotic number of graphs with a restriction on the maximum degree (Q2816121) (← links)
- 3-Perfect hamiltonian decomposition of the complete graph (Q2848739) (← links)
- Recursive generation of simple planar 5-regular graphs and pentangulations (Q2865033) (← links)
- Circular designs balanced for neighbours at distances one and two (Q2934771) (← links)
- Planar Hypohamiltonian Graphs on 40 Vertices (Q2958202) (← links)
- Subgraphs of Dense Random Graphs with Specified Degrees (Q2998852) (← links)
- (Q3001409) (← links)
- (Q3003886) (← links)
- (Q3024012) (← links)
- (Q3024021) (← links)
- (Q3032405) (← links)
- Random dense bipartite graphs and directed graphs with specified degrees (Q3055774) (← links)
- Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4 (Q3059085) (← links)
- (Q3096705) (← links)
- (Q3138966) (← links)
- Asymptotic Enumeration of Graphs with a Given Upper Bound on the Maximum Degree (Q3146986) (← links)
- (Q3315556) (← links)
- (Q3343999) (← links)
- (Q3344226) (← links)
- (Q3369055) (← links)
- Small latin squares, quasigroups, and loops (Q3427365) (← links)
- On the shape of a random acyclic digraph (Q3480068) (← links)
- Uniform generation of random regular graphs of moderate degree (Q3495665) (← links)
- Subgraphs of Random<i>k</i>-Edge-Coloured<i>k</i>-Regular Graphs (Q3552512) (← links)
- The asymptotic volume of the Birkhoff polytope (Q3565415) (← links)
- Recursive Generation of 5-Regular Planar Graphs (Q3605492) (← links)
- Spherical-Rectangular Drawings (Q3605510) (← links)
