The following pages link to Nicholas C. Wormald (Q704840):
Displaying 50 items.
- (Q326820) (redirect page) (← links)
- (Q186263) (redirect page) (← links)
- (Q1167189) (redirect page) (← links)
- (Q1242173) (redirect page) (← links)
- (Q186263) (redirect page) (← links)
- Properties of regular graphs with large girth via local algorithms (Q326821) (← links)
- It's a small world for random surfers (Q329281) (← links)
- Induced subgraphs in sparse random graphs with given degree sequences (Q427801) (← links)
- Cores of random \(r\)-partite hypergraphs (Q436312) (← links)
- Sharp concentration of the number of submaps in random planar triangulations (Q558223) (← links)
- Linear programming and the worst-case analysis of greedy algorithms on cubic graphs (Q612969) (← links)
- Enumeration of unrooted odd-valent regular planar maps (Q659785) (← links)
- Random hypergraph processes with degree restrictions (Q704841) (← links)
- Automorphisms of random graphs with specified vertices (Q760705) (← links)
- Bridge and cycle degrees of vertices of graphs (Q801939) (← links)
- Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane (Q804583) (← links)
- A new method of generating Hamiltonian cycles on the n-cube (Q804595) (← links)
- 3-star factors in random \(d\)-regular graphs (Q850076) (← links)
- Encores on cores (Q869995) (← links)
- A PTAS for the sparsest 2-spanner of 4-connected planar triangulations (Q876695) (← links)
- Enumeration of graphs with a heavy-tailed degree sequence (Q895547) (← links)
- Asymptotic number of forests from unrooted trees (Q909669) (← links)
- Longest cycles in 3-connected planar graphs (Q910413) (← links)
- Large forbidden trade volumes and edge packings of random graphs (Q924957) (← links)
- Expansion properties of a random regular graph after random vertex deletions (Q925017) (← links)
- Corrigendum to ``Counting connected graphs inside-out'' [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)] (Q933684) (← links)
- Birth control for giants (Q949755) (← links)
- On the hardness of sampling independent sets beyond the tree threshold (Q1017883) (← links)
- Rate of convergence of the short cycle distribution in random regular graphs generated by pegging (Q1028821) (← links)
- On the chromatic number of random \(d\)-regular graphs (Q1043497) (← links)
- The number of loopless planar maps (Q1057283) (← links)
- Counting labelled chordal graphs (Q1062069) (← links)
- Characterizing intersection classes of graphs (Q1078582) (← links)
- The asymptotic number of acyclic digraphs. I (Q1080860) (← links)
- Optimal worst case trees (Q1101234) (← links)
- The asymptotic number of rooted nonseparable maps on a surface (Q1110533) (← links)
- Local edge-connectivity in regular bipartite graphs (Q1113921) (← links)
- Random triangulations of the plane (Q1114717) (← links)
- The asymptotic distribution of short cycles in random regular graphs (Q1143412) (← links)
- The asymptotic connectivity of labelled regular graphs (Q1143413) (← links)
- Counting unrooted planar maps (Q1155627) (← links)
- Minimal decompositions of graphs into mutually isomorphic subgraphs (Q1167190) (← links)
- The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices (Q1173631) (← links)
- Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\) (Q1181014) (← links)
- The exponential generating function of labelled blocks (Q1242174) (← links)
- The asymptotic number of set partitions with unequal block sizes (Q1277138) (← links)
- A tree-based mergesort (Q1284695) (← links)
- Infinite highly arc transitive digraphs and universal covering digraphs (Q1316644) (← links)
- Edge crossings in drawings of bipartite graphs (Q1322570) (← links)
- Spanning Eulerian subgraphs of bounded degree in triangulations (Q1334938) (← links)
- Random graph processes with maximum degree 2 (Q1355743) (← links)
- Full minimal Steiner trees on lattice sets (Q1356020) (← links)
- On the linear \(k\)-arboricity of cubic graphs (Q1356680) (← links)
- Minimal Steiner trees for rectangular arrays of lattice points (Q1364229) (← links)
