Nicholas C. Wormald

171 papers A* 6A 1B 3Misc 1Journal 153Unranked 6
YearRankTypeTitle / Venue / Authors
2022 J jnl
Component Games on Random Graphs.
Comb.
Rani Hod, Michael Krivelevich, Tobias Müller, Alon Naor, Nicholas C. Wormald
2021 J jnl
Fast uniform generation of random graphs with given degree sequences.
Random Struct. Algorithms
Andrii Arman, Pu Gao, Nicholas C. Wormald
2021 J jnl
Linear-time uniform generation of random sparse contingency tables with specified marginals.
CoRR
Andrii Arman, Pu Gao, Nicholas C. Wormald
2019 A* conf
Fast Uniform Generation of Random Graphs with Given Degree Sequences.
FOCS
Andrii Arman, Pu Gao, Nicholas C. Wormald
2019 J jnl
Fast uniform generation of random graphs with given degree sequences.
CoRR
Andrii Arman, Pu Gao, Nicholas C. Wormald
2019 J jnl
Meyniel's conjecture holds for random d-regular graphs.
Random Struct. Algorithms
Pawel Pralat, Nicholas C. Wormald
2018 J jnl
Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs.
Comb.
Carlos Hoppen, Nicholas C. Wormald
2018 A* conf
Uniform generation of random graphs with power-law degree sequences.
SODA
Pu Gao, Nicholas C. Wormald
2017 J jnl
Minimum Power Dominating Sets of Random Cubic Graphs.
J. Graph Theory
Liying Kang, Nicholas C. Wormald
2017 J jnl
Uniform Generation of Random Regular Graphs.
SIAM J. Comput.
Pu Gao, Nicholas C. Wormald
2017 J jnl
Uniform generation of random graphs with power-law degree sequences.
CoRR
Pu Gao, Nicholas C. Wormald
2016 J jnl
Meyniel's conjecture holds for random graphs.
Random Struct. Algorithms
Pawel Pralat, Nicholas C. Wormald
2016 J jnl
Properties of regular graphs with large girth via local algorithms.
J. Comb. Theory B
Carlos Hoppen, Nicholas C. Wormald
2016 J jnl
The threshold for combs in random graphs.
Random Struct. Algorithms
Jeff Kahn, Eyal Lubetzky, Nicholas C. Wormald
2015 J jnl
Orientability Thresholds for Random Hypergraphs.
Comb. Probab. Comput.
Pu Gao, Nicholas C. Wormald
2015 A* conf
Uniform Generation of Random Regular Graphs.
FOCS
Pu Gao, Nicholas C. Wormald
2015 J jnl
Uniform generation of random regular graphs.
CoRR
Pu Gao, Nicholas C. Wormald
2014 J jnl
The evolution and structure of social networks.
Netw. Sci.
Whitman Richards, Nicholas C. Wormald
2014 J jnl
The mixing time of the giant component of a random graph.
Random Struct. Algorithms
Itai Benjamini, Gady Kozma, Nicholas C. Wormald
2013 J jnl
An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph.
SIAM J. Discret. Math.
Graeme Kemkes, Nicholas C. Wormald
2013 J jnl
Asymptotic enumeration of sparse 2-connected graphs.
Random Struct. Algorithms
Graeme Kemkes, Cristiane M. Sato, Nicholas C. Wormald
2013 J jnl
Asymptotic enumeration of strongly connected digraphs by vertices and edges.
Random Struct. Algorithms
Xavier Pérez-Giménez, Nicholas C. Wormald
2012 J jnl
Cores of random r-partite hypergraphs.
Inf. Process. Lett.
Fabiano C. Botelho, Nicholas C. Wormald, Nivio Ziviani
2012 J jnl
Gradient-Constrained Minimum Networks. III. Fixed Topology.
J. Optim. Theory Appl.
Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald
2012 J jnl
Induced subgraphs in sparse random graphs with given degree sequences.
Eur. J. Comb.
Pu Gao, Yi Su, Nicholas C. Wormald
2011 J jnl
Disjoint Hamilton cycles in the random geometric graph.
J. Graph Theory
Tobias Müller, Xavier Pérez-Giménez, Nicholas C. Wormald
2011 J jnl
Geodesics and almost geodesic cycles in random regular graphs.
J. Graph Theory
Itai Benjamini, Carlos Hoppen, Eran Ofek, Pawel Pralat, Nicholas C. Wormald
2011 J jnl
On the threshold for k-regular subgraphs of random graphs.
Comb.
Pawel Pralat, Jacques Verstraëte, Nicholas C. Wormald
2011 J jnl
Pegging Graphs Yields a Small Diameter.
Comb. Probab. Comput.
Stefanie Gerke, Angelika Steger, Nicholas C. Wormald
2011 J jnl
Regular induced subgraphs of a random Graph.
Random Struct. Algorithms
Michael Krivelevich, Benny Sudakov, Nicholas C. Wormald
2010 J jnl
Asymptotics of Some Convolutional Recurrences.
Electron. J. Comb.
Edward A. Bender, Adri B. Olde Daalhuis, Zhicheng Gao, L. Bruce Richmond, Nicholas C. Wormald
2010 J jnl
Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs.
Electron. J. Comb.
William Duckworth, Nicholas C. Wormald
2010 A* conf
Load balancing and orientability thresholds for random hypergraphs.
STOC
Pu Gao, Nicholas C. Wormald
2010 J jnl
Orientability thresholds for random hypergraphs
CoRR
Pu Gao, Nicholas C. Wormald
2010 J jnl
The Diameter of Sparse Random Graphs.
Comb. Probab. Comput.
Oliver Riordan, Nicholas C. Wormald
2009 J jnl
On the chromatic number of a random 5-regular graph.
J. Graph Theory
Josep Díaz, Alexis C. Kaporis, G. D. Kemkes, Lefteris M. Kirousis, Xavier Pérez-Giménez, Nicholas C. Wormald
2009 J jnl
Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging.
Electron. J. Comb.
Pu Gao, Nicholas C. Wormald
2009 — conf
Representing Small Group Evolution.
CSE (4)
Whitman Richards, Nicholas C. Wormald
2009 J jnl
Short cycle distribution in random regular graphs recursively generated by pegging.
Random Struct. Algorithms
Pu Gao, Nicholas C. Wormald
2008 J jnl
Cleaning Regular Graphs with Brushes.
SIAM J. Discret. Math.
Noga Alon, Pawel Pralat, Nicholas C. Wormald
2008 J jnl
Corrigendum to "Counting connected graphs inside-out" [J. Combin. Theory Ser. B 93 (2005) 127-172].
J. Comb. Theory B
Boris G. Pittel, Nicholas C. Wormald
2008 J jnl
Distribution of subgraphs of random regular graphs.
Random Struct. Algorithms
Zhicheng Gao, Nicholas C. Wormald
2008 J jnl
Expansion properties of a random regular graph after random vertex deletions.
Eur. J. Comb.
Catherine S. Greenhill, Fred B. Holt, Nicholas C. Wormald
2008 J jnl
Induced Forests in Regular Graphs with Large Girth.
Comb. Probab. Comput.
Carlos Hoppen, Nicholas C. Wormald
2008 J jnl
Large forbidden trade volumes and edge packings of random graphs.
Discret. Math.
Nicholas C. Wormald, Sanming Zhou
2008 J jnl
Walkers on the Cycle and the Grid.
SIAM J. Discret. Math.
Josep Díaz, Xavier Pérez-Giménez, Maria J. Serna, Nicholas C. Wormald
2007 J jnl
Birth control for giants.
Comb.
Joel H. Spencer, Nicholas C. Wormald
2007 J jnl
Bounds on the bisection width for random d -regular graphs.
Theor. Comput. Sci.
Josep Díaz, Maria J. Serna, Nicholas C. Wormald
2007 — conf
Cleaning Random
CAAN
Margaret-Ellen Messinger, Pawel Pralat, Richard J. Nowakowski, Nicholas C. Wormald
2007 J jnl
Colouring Random 4-Regular Graphs.
Comb. Probab. Comput.
Lingsheng Shi, Nicholas C. Wormald
2007 J jnl
Colouring Random Regular Graphs.
Comb. Probab. Comput.
Lingsheng Shi, Nicholas C. Wormald
2007 — conf
Constrained Path Optimisation for Underground Mine Layout.
World Congress on Engineering
Marcus Brazil, Peter Alexander Grossman, David H. Lee, J. Hyam Rubinstein, Doreen A. Thomas, Nicholas C. Wormald
2007 J jnl
Growing Protean Graphs.
Internet Math.
Pawel Pralat, Nicholas C. Wormald
2007 J jnl
Hamiltonicity of random graphs produced by 2-processes.
Random Struct. Algorithms
András Telcs, Nicholas C. Wormald, Sanming Zhou
2007 J jnl
Large independent sets in regular graphs of large girth.
J. Comb. Theory B
Joseph Lauer, Nicholas C. Wormald
2007 J jnl
Network modelling of underground mine layout: two case studies.
Int. Trans. Oper. Res.
Doreen A. Thomas, Marcus Brazil, David H. Lee, Nicholas C. Wormald
2007 J jnl
Rainbow Hamilton cycles in random regular graphs.
Random Struct. Algorithms
Svante Janson, Nicholas C. Wormald
2007 A* conf
The random graph threshold for
SODA
Julie Anne Cain, Peter Sanders, Nicholas C. Wormald
2006 J jnl
3-star factors in random
Eur. J. Comb.
Hilda Assiyatun, Nicholas C. Wormald
2006 — conf
Analysis of Algorithms on the Cores of Random Graphs.
APPROX-RANDOM
Nicholas C. Wormald
2006 J jnl
Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees.
J. Glob. Optim.
J. Hyam Rubinstein, Jia F. Weng, Nicholas C. Wormald
2006 J jnl
Encores on Cores.
Electron. J. Comb.
Julie Cain, Nicholas C. Wormald
2006 J jnl
On the Independent Domination Number of Random Regular Graphs.
Comb. Probab. Comput.
William Duckworth, Nicholas C. Wormald
2006 J jnl
The generalized acyclic edge chromatic number of random regular graphs.
J. Graph Theory
Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald
2005 A conf
Connectivity for Wireless Agents Moving on a Cycle or Grid.
STACS
Josep Díaz, Xavier Pérez-Giménez, Maria J. Serna, Nicholas C. Wormald
2005 J jnl
Counting connected graphs inside-out.
J. Comb. Theory B
Boris G. Pittel, Nicholas C. Wormald
2005 J jnl
Random
Comb.
Alan M. Frieze, Nicholas C. Wormald
2005 J jnl
The acyclic edge chromatic number of a random
J. Graph Theory
Jaroslav Nesetril, Nicholas C. Wormald
2004 J jnl
Avoidance of a giant component in half the edge set of a random graph.
Random Struct. Algorithms
Tom Bohman, Alan M. Frieze, Nicholas C. Wormald
2004 B conf
Computation of the Bisection Width for Random d-Regular Graphs.
LATIN
Josep Díaz, Maria J. Serna, Nicholas C. Wormald
2004 J jnl
Hamiltonian decompositions of random bipartite regular graphs.
J. Comb. Theory B
Catherine S. Greenhill, Jeong Han Kim, Nicholas C. Wormald
2004 J jnl
Random Hypergraph Processes with Degree Restrictions.
Graphs Comb.
Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
2004 J jnl
Short Cycles in Random Regular Graphs.
Electron. J. Comb.
Brendan D. McKay, Nicholas C. Wormald, Beata Wysocka
2004 J jnl
To Adrian Bondy and U. S. R. Murty.
J. Comb. Theory B
William H. Cunningham, Penny E. Haxell, R. Bruce Richter, Nicholas C. Wormald, Andrew Thomason
2003 J jnl
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations.
J. Discrete Algorithms
William Duckworth, Nicholas C. Wormald, Michele Zito
2003 J jnl
Analysis of greedy algorithms on graphs with bounded degrees.
Discret. Math.
Nicholas C. Wormald
2003 — ch.
Analytic Graph Theory.
Handbook of Graph Theory
Béla Bollobás, Vladimir Nikiforov, Nicholas C. Wormald, Ralph J. Faudree, Alan M. Frieze
2003 J jnl
Asymptotic enumeration of sparse graphs with a minimum degree constraint.
J. Comb. Theory A
Boris G. Pittel, Nicholas C. Wormald
2003 J jnl
Bounds on the max and min bisection of random cubic and random 4-regular graphs.
Theor. Comput. Sci.
Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald
2003 J jnl
Connectedness Of The Degree Bounded Star Process.
Comb. Probab. Comput.
Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
2003 J jnl
Enumeration of
Graphs Comb.
Robert Castelo, Nicholas C. Wormald
2003 J jnl
On the probability of independent sets in random graphs.
Random Struct. Algorithms
Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
2003 J jnl
Sharp Concentration of the Number of Submaps in Random Planar Triangulations.
Comb.
Zhicheng Gao, Nicholas C. Wormald
2002 J jnl
Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree.
Comb. Probab. Comput.
Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald
2002 — conf
Bisection of Random Cubic Graphs.
RANDOM
Josep Díaz, Norman Do, Maria J. Serna, Nicholas C. Wormald
2002 J jnl
Decycling numbers of random regular graphs.
Random Struct. Algorithms
Sheng Bau, Nicholas C. Wormald, Sanming Zhou
2002 J jnl
Minimum independent dominating sets of random cubic graphs.
Random Struct. Algorithms
William Duckworth, Nicholas C. Wormald
2002 J jnl
Permutation Pseudographs And Contiguity.
Comb. Probab. Comput.
Catherine S. Greenhill, Svante Janson, Jeong Han Kim, Nicholas C. Wormald
2002 J jnl
The Number of Labeled 2-Connected Planar Graphs.
Electron. J. Comb.
Edward A. Bender, Zhicheng Gao, Nicholas C. Wormald
2001 J jnl
A polynomial algorithm for a constrained traveling salesman problem.
Networks
J. Hyam Rubinstein, Doreen A. Thomas, Nicholas C. Wormald
2001 J jnl
Counting 5-connected planar triangulations.
J. Graph Theory
Zhicheng Gao, Ian M. Wanless, Nicholas C. Wormald
2001 J jnl
Gradient-constrained minimum networks. I. Fundamentals.
J. Glob. Optim.
Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald
2001 J jnl
Hamilton cycles containing randomly selected edges in random regular graphs.
Random Struct. Algorithms
Robert W. Robinson, Nicholas C. Wormald
2001 J jnl
Linear Arboricity and Linear k-Arboricity of Regular Graphs.
Graphs Comb.
Noga Alon, Vanessa Teague, Nicholas C. Wormald
2001 J jnl
Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs.
J. Comb. Theory B
Jeong Han Kim, Nicholas C. Wormald
2001 J jnl
Random regular graphs of high degree.
Random Struct. Algorithms
Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
2001 J jnl
Regular Graphs with No Homomorphisms onto Cycles.
J. Comb. Theory B
Ian M. Wanless, Nicholas C. Wormald
2000 J jnl
Covering regular graphs with forests of small trees.
Australas. J Comb.
Hilda Assiyatun, Nicholas C. Wormald
2000 Misc conf
Maximum Induced Matchings of Random Cubic Graphs.
COCOON
William Duckworth, Nicholas C. Wormald, Michele Zito
2000 J jnl
Random Star Processes.
Comb. Probab. Comput.
Hanna D. Robalewska, Nicholas C. Wormald
2000 J jnl
The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding Given Subtrees.
Discret. Appl. Math.
Meei Pyng Ng, Mike A. Steel, Nicholas C. Wormald
2000 J jnl
The Distribution of the Maximum Vertex Degree in Random Planar Maps.
J. Comb. Theory A
Zhicheng Gao, Nicholas C. Wormald
2000 J jnl
The asymptotic number of graphs with a restriction on the maximum degree.
Electron. Notes Discret. Math.
Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald
1999 J jnl
Generating Random Regular Graphs Quickly.
Comb. Probab. Comput.
Angelika Steger, Nicholas C. Wormald
1999 J jnl
The Asymptotic Number of Set Partitions with Unequal Block Sizes.
Electron. J. Comb.
Arnold Knopfmacher, Andrew M. Odlyzko, Boris G. Pittel, L. Bruce Richmond, Dudley Stark, George Szekeres, Nicholas C. Wormald
1999 J jnl
The Size of the Largest Components in Random Planar Maps.
SIAM J. Discret. Math.
Zhicheng Gao, Nicholas C. Wormald
1998 J jnl
A Tree-Based Mergesort.
Acta Informatica
Alistair Moffat, Ola Petersson, Nicholas C. Wormald
1998 J jnl
Factorisation of regular graphs into forests of short paths.
Discret. Math.
Terri Lindquester, Nicholas C. Wormald
1998 A* conf
Geometric Separator Theorems & Applications.
FOCS
Warren D. Smith, Nicholas C. Wormald
1998 J jnl
More on the linear k-arboricity of regular graphs.
Australas. J Comb.
Robert E. L. Aldred, Nicholas C. Wormald
1997 J jnl
1-Factorizations of random regular graphs.
Random Struct. Algorithms
Michael Molloy, Hanna D. Robalewska, Robert W. Robinson, Nicholas C. Wormald
1997 J jnl
Asymptotic Enumeration of Convex Polygons.
J. Comb. Theory A
Dudley Stark, Nicholas C. Wormald
1997 J jnl
Full Minimal Steiner Trees on Lattice Sets.
J. Comb. Theory A
Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald
1997 J jnl
Minimal Steiner Trees for Rectangular Arrays of Lattice Points.
J. Comb. Theory A
Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald
1997 — conf
Shortest networks on spheres.
Network Design: Connectivity and Facilities Location
Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald
1997 J jnl
Steiner Trees for Terminals Constrained to Curves.
SIAM J. Discret. Math.
J. Hyam Rubinstein, Doreen A. Thomas, Nicholas C. Wormald
1997 J jnl
The degree sequence of a random graph. I. The models.
Random Struct. Algorithms
Brendan D. McKay, Nicholas C. Wormald
1996 J jnl
A Family of Perfect Hashing Methods.
Comput. J.
Bohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech
1996 J jnl
Generating and Counting Hamilton Cycles in Random Regular Graphs.
J. Algorithms
Alan M. Frieze, Mark Jerrum, Michael Molloy, Robert W. Robinson, Nicholas C. Wormald
1996 J jnl
Minimal Steiner Trees for 2
J. Comb. Theory A
Marcus Brazil, T. Cole, J. Hyam Rubinstein, Doreen A. Thomas, Jia F. Weng, Nicholas C. Wormald
1996 J jnl
On the linear k-arboricity of cubic graphs.
Discret. Math.
Bill Jackson, Nicholas C. Wormald
1996 J jnl
Reconstruction of Rooted Trees From Subtrees.
Discret. Appl. Math.
Meei Pyng Ng, Nicholas C. Wormald
1996 J jnl
Sudden Emergence of a Giant
J. Comb. Theory B
Boris G. Pittel, Joel Spencer, Nicholas C. Wormald
1996 J jnl
The perturbation method and triangle-free random graphs.
Random Struct. Algorithms
Nicholas C. Wormald
1995 J jnl
Almost All Maps Are Asymmetric.
J. Comb. Theory B
L. Bruce Richmond, Nicholas C. Wormald
1995 J jnl
Largest 4-Connected Components of 3-Connected Planar Triangulations.
Random Struct. Algorithms
Edward A. Bender, L. Bruce Richmond, Nicholas C. Wormald
1995 J jnl
Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected
J. Comb. Theory B
Bill Jackson, Nicholas C. Wormald
1994 J jnl
Almost All Regular Graphs Are Hamiltonian.
Random Struct. Algorithms
Robert W. Robinson, Nicholas C. Wormald
1994 J jnl
Edge Crossings in Drawings of Bipartite Graphs.
Algorithmica
Peter Eades, Nicholas C. Wormald
1994 J jnl
Spanning eulerian subgraphs of bounded degree in triangulations.
Graphs Comb.
Zhicheng Gao, Nicholas C. Wormald
1993 B conf
Graphs, Hypergraphs and Hashing.
WG
George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech
1993 J jnl
Infinite highly arc transitive digraphs and universal covering digraphs.
Comb.
Peter J. Cameron, Cheryl E. Praeger, Nicholas C. Wormald
1993 J jnl
Performance Guarantees for Motion Planning with Temporal Uncertainty.
Aust. Comput. J.
Peter Eades, Xuemin Lin, Nicholas C. Wormald
1992 J jnl
Almost All Cubic Graphs Are Hamiltonian.
Random Struct. Algorithms
Robert W. Robinson, Nicholas C. Wormald
1992 J jnl
Enumeration of Almost-Convex Polygons on the Square Lattice.
Random Struct. Algorithms
Ian G. Enting, Anthony J. Guttmann, L. Bruce Richmond, Nicholas C. Wormald
1992 J jnl
Longest cycles in 3-connected planar graphs.
J. Comb. Theory B
Bill Jackson, Nicholas C. Wormald
1992 J jnl
Random Graph Processes with Degree Restrictions.
Comb. Probab. Comput.
Andrzej Rucinski, Nicholas C. Wormald
1992 B conf
Sorting and/by Merging Finger Trees.
ISAAC
Alistair Moffat, Ola Petersson, Nicholas C. Wormald
1991 J jnl
Asymptotic enumeration by degree sequence of graphs with degress o(n
Comb.
Brendan D. McKay, Nicholas C. Wormald
1990 J jnl
Asymptotic Enumeration by Degree Sequence of Graphs of High Degree.
Eur. J. Comb.
Brendan D. McKay, Nicholas C. Wormald
1990 J jnl
Cycles containing matchings and pairwise compatible euler tours.
J. Graph Theory
Bill Jackson, Nicholas C. Wormald
1990 J jnl
Fixed edge-length graph drawing is NP-hard.
Discret. Appl. Math.
Peter Eades, Nicholas C. Wormald
1990 J jnl
On the Distribution of Lengths of Evolutionary Trees.
SIAM J. Discret. Math.
M. Carter, Michael D. Hendy, David Penny, László A. Székely, Nicholas C. Wormald
1990 J jnl
Removable edges in 3-connected graphs.
J. Graph Theory
Derek A. Holton, Bill Jackson, Akira Saito, Nicholas C. Wormald
1990 J jnl
Uniform Generation of Random Regular Graphs of Moderate Degree.
J. Algorithms
Brendan D. McKay, Nicholas C. Wormald
1990 J jnl
k-walks of graphs.
Australas. J Comb.
Bill Jackson, Nicholas C. Wormald
1989 J jnl
Bounds on the measurable chromatic number of R
Discret. Math.
László A. Székely, Nicholas C. Wormald
1988 J jnl
Random Triangulations of the Plane.
Eur. J. Comb.
L. Bruce Richmond, Nicholas C. Wormald
1988 J jnl
The asymptotic number of rooted nonseparable maps on a surface.
J. Comb. Theory A
Edward A. Bender, Nicholas C. Wormald
1987 J jnl
Generating Random Unlabelled Graphs.
SIAM J. Comput.
Nicholas C. Wormald
1987 J jnl
Ménage numbers, bijections and P-recursiveness.
Discret. Math.
E. Rodney Canfield, Nicholas C. Wormald
1987 J jnl
Optimal Worst Case Trees.
Acta Informatica
Edward A. Bender, Cheryl E. Praeger, Nicholas C. Wormald
1986 J jnl
Extremal clique coverings of complementary graphs.
Comb.
D. de Caen, Paul Erdös, Norman J. Pullmann, Nicholas C. Wormald
1986 J jnl
The asymptotic number of acyclic diagraphs I.
Comb.
Edward A. Bender, L. Bruce Richmond, Robert W. Robinson, Nicholas C. Wormald
1985 J jnl
Cataloguing the graphs on 10 vertices.
J. Graph Theory
R. D. Cameron, Charles J. Colbourn, Ronald C. Read, Nicholas C. Wormald
1985 J jnl
Counting labelled chordal graphs.
Graphs Comb.
Nicholas C. Wormald
1985 J jnl
Enumeration of cyclically 4-connected cubic graphs.
J. Graph Theory
Nicholas C. Wormald
1985 J jnl
Regular factors of regular graphs.
J. Graph Theory
Béla Bollobás, Akira Saito, Nicholas C. Wormald
1985 J jnl
The number of loopless planar maps.
Discret. Math.
Edward A. Bender, Nicholas C. Wormald
1984 J jnl
Automorphisms of random graphs with specified vertices.
Comb.
Brendan D. McKay, Nicholas C. Wormald
1984 J jnl
Generating Random Regular Graphs.
J. Algorithms
Nicholas C. Wormald
1984 J jnl
Isomorphic factorizations VII. Regular graphs and tournaments.
J. Graph Theory
Nicholas C. Wormald
1983 J jnl
Numbers of cubic graphs.
J. Graph Theory
Robert W. Robinson, Nicholas C. Wormald
1981 J jnl
Counting the 10-point graphs by partition.
J. Graph Theory
Ronald C. Read, Nicholas C. Wormald
1981 J jnl
Counting unrooted planar maps.
Discret. Math.
Nicholas C. Wormald
1981 J jnl
The asymptotic connectivity of labelled regular graphs.
J. Comb. Theory B
Nicholas C. Wormald
1981 J jnl
The asymptotic distribution of short cycles in random regular graphs.
J. Comb. Theory B
Nicholas C. Wormald
1980 J jnl
Number of labeled 4-regular graphs.
J. Graph Theory
Ronald C. Read, Nicholas C. Wormald
1978 J jnl
Achiral plane trees.
J. Graph Theory
Nicholas C. Wormald
1977 J jnl
Counting labelled 3-connected graphs.
J. Graph Theory
Nicholas C. Wormald
1977 J jnl
The divisibility theorem for isomorphic factorizations of complete graphs.
J. Graph Theory
Frank Harary, Robert W. Robinson, Nicholas C. Wormald