( en | de | ru )

 

Disambiguation of "Wormald, Nicholas C."

Author of the publication

copydeleteadd this publication to your clipboard
The threshold for combs in random graphs.

, , and . Random Struct. Algorithms, 48 (4): 794-802 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nicholas Mitchell

Nicholas Kiefer

Nicholas Pascoe

Nicholas Loewer

Nicholas Ring

 

Other publications of authors with the same name

A Tree-Based Mergesort., , and . Acta Inf., 35 (9): 775-793 (1998)Large forbidden trade volumes and edge packings of random graphs., and . Discret. Math., 308 (13): 2751-2755 (2008)The number of loopless planar maps., and . Discret. Math., 54 (2): 235-237 (1985)Cataloguing the graphs on 10 vertices., , , and . J. Graph Theory, 9 (4): 551-562 (1985)Load balancing and orientability thresholds for random hypergraphs., and . STOC, page 97-104. ACM, (2010)Fast Uniform Generation of Random Graphs with Given Degree Sequences., , and . FOCS, page 1371-1379. IEEE Computer Society, (2019)A PTAS for the sparsest 2-spanner of 4-connected planar triangulations., , and . J. Discrete Algorithms, 1 (1): 67-76 (2003)Representing Small Group Evolution., and . CSE (4), page 159-165. IEEE Computer Society, (2009)Almost All Cubic Graphs Are Hamiltonian., and . Random Struct. Algorithms, 3 (2): 117-126 (1992)Hamilton cycles containing randomly selected edges in random regular graphs., and . Random Struct. Algorithms, 19 (2): 128-147 (2001)