PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Wormald, Nicholas C."

Author of the publication

copydeleteadd this publication to your clipboard
Pegging Graphs Yields a Small Diameter.

, , and . Combinatorics, Probability & Computing, 20 (2): 239-248 (2011)

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.

C. Traut

C. Honold

Dr. Torbjörn Cunis University of Stuttgart

Vanessa Costalonga Martins University of Stuttgart

April M. Cooper

 

Other publications of authors with the same name

On the threshold for k-regular subgraphs of random graphs., , and . Combinatorica, 31 (5): 565-581 (2011)Numbers of cubic graphs., and . Journal of Graph Theory, 7 (4): 463-467 (1983)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)The mixing time of the giant component of a random graph., , and . Random Struct. Algorithms, 45 (3): 383-407 (2014)Growing Protean Graphs., and . Internet Mathematics, 4 (1): 1-16 (2007)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)On the linear k-arboricity of cubic graphs., and . Discrete Mathematics, 162 (1-3): 293-297 (1996)Large independent sets in regular graphs of large girth., and . J. Comb. Theory, Ser. B, 97 (6): 999-1009 (2007)