The following pages link to Brendan D. McKay (Q168496):
Displaying 50 items.
- On a bound of Hoeffding in the complex case (Q287793) (← links)
- (Q324778) (redirect page) (← links)
- A faster test for 4-flow-criticality in snarks (Q324779) (← links)
- Recursive generation of IPR fullerenes (Q498482) (← links)
- Computational determination of (3,11) and (4,7) cages (Q553952) (← links)
- Constructing cospectral graphs (Q595685) (← links)
- Posets on up to 16 points (Q698446) (← links)
- (Q709829) (redirect page) (← links)
- To be or not to be Yutsis: algorithms for the decision problem (Q709830) (← links)
- On Ryser's conjecture for linear intersecting multipartite hypergraphs (Q730257) (← links)
- Automorphisms of random graphs with specified vertices (Q760705) (← links)
- Counting loopy graphs with given degrees (Q763074) (← links)
- (Q801086) (redirect page) (← links)
- Hamiltonian cycles in cubic 3-connected bipartite planar graphs (Q801087) (← links)
- The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs (Q805627) (← links)
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums (Q817603) (← links)
- The number of transversals in a Latin square (Q851756) (← links)
- Erratum to: The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices (Q912862) (← links)
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums (Q953898) (← links)
- Rectangular-radial drawings of cubic plane graphs (Q991189) (← links)
- Graph structural properties of non-Yutsis graphs allowing fast recognition (Q1003683) (← links)
- Spanning trees in regular graphs (Q1053029) (← links)
- Integer sequences with proscribed differences and bounded growth rate (Q1060216) (← links)
- An algorithm for generating subsets of fixed size with a strong minimal change property (Q1060849) (← links)
- The number of matchings in random regular graphs and bipartite graphs (Q1081621) (← links)
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices (Q1085184) (← links)
- Determinants and ranks of random matrices over \({\mathbb{Z}}_ m\) (Q1092979) (← links)
- Feasibility conditions for the existence of walk-regular graphs (Q1148333) (← links)
- A correction to Colbourn's paper on the complexity of matrix symmetrizability (Q1150268) (← links)
- The expected eigenvalue distribution of a large regular graph (Q1156146) (← links)
- A nine point theorem for 3-connected graphs (Q1165867) (← links)
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\) (Q1181014) (← links)
- Ralph Gordon Stanton (Q1182916) (← links)
- Spectral conditions for the reconstructibility of a graph (Q1252246) (← links)
- Hadamard equivalence via graph isomorphism (Q1255008) (← links)
- A note on large graphs of diameter two and given maximum degree (Q1272472) (← links)
- Most Latin squares have many subsquares (Q1291124) (← links)
- Linear programming in some Ramsey problems (Q1328393) (← links)
- NC algorithms for dynamically solving the all pairs shortest paths problem and related problems (Q1350623) (← links)
- Subgraph counting identities and Ramsey numbers (Q1354725) (← links)
- Determinants of matrices of the conference type (Q1362671) (← links)
- The asymptotic number of labeled graphs with \(n\) vertices, \(q\) edges, and no isolated vertices (Q1369735) (← links)
- Maximising the permanent of \((0,1)\)-matrices and the number of extensions of Latin rectangles (Q1379135) (← links)
- Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums (Q1414144) (← links)
- The asymptotic number of claw-free cubic graphs. (Q1415549) (← links)
- The distributions of the entries of Young tableaux (Q1604574) (← links)
- Short cycles in random regular graphs (Q1773189) (← links)
- (Q1812885) (redirect page) (← links)
- Odd degree polynomials with dihedral Galois groups (Q1812886) (← links)
- The exponent set of symmetric primitive (0,1) matrices with zero trace (Q1813813) (← links)
