- Cleaning regular graphs with brushes Pawel Pralat
- Regular graphs with no homomorphisms onto cycles I. M. Wanless
- A Network Model to Optimise Cost in Underground Mine , D. H. Lee
- Enumeration of P4-free chordal graphs Robert Castelo
- Network modelling of underground mine layout: Two case studies
- Smith & Wormald typeset 1205 Jul 24, 1998 Separator theorems Geometric separator theorems
- Models of random regular graphs N. C. Wormald
- Almost All Regular Graphs are Hamiltonian R. W. Robinson
- The Random Graph Threshold for k-orientiability and a Fast Algorithm for Optimal Multiple-Choice Allocation
- On the probability of independent sets in random graphs Michael Krivelevich
- RAINBOW HAMILTON CYCLES IN RANDOM REGULAR SVANTE JANSON AND NICHOLAS WORMALD
- Combinatorics, Probability and Computing (19XX) 00, 111. c 19XX Cambridge University Press DOI: 10.1017/S0000000000000000 Printed in the United Kingdom
- On the chromatic number of random d-regular graphs Graeme Kemkes
- On the threshold for k-regular subgraphs random graphs
- Rate of convergence of the short cycle distribution in random regular graphs generated by pegging
- Linear Programming and the Worst-Case Analysis of Greedy
- On the hardness of sampling independent sets beyond the tree Elchanan Mossel
- Maximum Induced Matchings of Random Cubic Graphs
- Smith & Wormald typeset 966 Apr 29, 1998 Separator theorems Geometric separator theorems and
- Enumeration of rooted cubic planar maps Zhicheng Gao
- Birth Control for Giants Joel Spencer
- The asymptotic number of set partitions with unequal block A. Knopfmacher
- Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees
- Hamilton Cycles Containing Randomly Selected Edges in Random Regular Graphs
- Tournaments with many Hamilton cycles N. C. Wormald
- Colouring random 4-regular graphs Lingsheng Shi
- Avoiding a Giant Component II and Alan Frieze
- A Polynomial Algorithm for a Constrained Travelling Salesman Problem
- Connectedness of graphs generated by a random d-process
- Gradient-Constrained Minimum Networks, I. Fundamentals 1
- Asymptotic enumeration of graphs with a given upper bound on the maximum degree
- Random matchings which induce Hamilton cycles, and hamiltonian decompositions of random regular graphs
- Asymptotic enumeration of strongly connected digraphs by vertices and edges
- Representing Small Group Evolution Whitman Richards
- Connectivity for Wireless Agents Moving on a Cycle or Grid
- Access Optimisation Tools in Underground Mine Design Marcus Brazil, Peter Grossman, David Lee, Hyam Rubinstein, Doreen Thomas, Nicholas
- Large Forbidden Trade Volumes of Random Nicholas C. Wormald
- The Perturbation Method and Triangle-free Random Nicholas C. Wormald
- Bounds on the bisection width for random d-regular graphs
- Hamiltonian decompositions of random bipartite regular Catherine Greenhill
- Generating and counting Hamilton cycles in random regular graphs
- Counting connected graphs inside-out Boris Pittel
- On the chromatic number of a random 5-regular graph A.C. Kaporis
- 3-star factors in random d-regular graphs Hilda Assiyatun
- Linear arboricity and linear k-arboricity of regular graphs N. Alon V. J. Teague y N. C. Wormald z
- Encores on cores Department of Mathematics and Statistics
- Asymptotic enumeration of sparse 2-connected graphs Graeme Kemkes
- Load balancing and orientability thresholds for random hypergraphs and Nicholas Wormald
- The Number of Labeled 2-Connected Planar Graphs Edward A. Bender
- Connectedness of the degree bounded star process Catherine Greenhill
- Approximation Algorithms for Finding Sparse 2-Spanners of 4-Connected Planar Triangulations
- Orientability thresholds for random hypergraphs Department of Combinatorics and Optimization
- An improved upper bound on the length of the longest cycle of a supercritical random graph
- The diameter of sparse random graphs Oliver Riordan
- Random k-SAT: A tight threshold for moderately growing k Alan Frieze
- Distribution of subgraphs of random regular graphs Zhicheng Gao
- Cleaning Random d-regular Graphs with Using a Degree-greedy Algorithm
- Colouring random regular graphs Lingsheng Shi
- The generalised acyclic edge chromatic number of random regular graphs
- Short cycles in random regular graphs Brendan D. McKay
- Analysis of greedy algorithms on graphs with bounded degrees
- Maximum Induced Matchings of Random Cubic Graphs
- Minimum Independent Dominating Sets of Random Cubic Graphs
- Walkers on the cycle and the grid N.C. Wormald
- Hamiltonicity of random graphs produced by 2-processes
- Random hypergraph processes with degree restrictions
- GROWING PROTEAN GRAPHS PAWEL PRALAT AND NICHOLAS WORMALD
- Asymptotic normality determined by high moments, and submap counts of random maps
- Sharp concentration of the number of submaps in random planar triangulations
- Asymptotics of Some Convolutional Recurrences Edward A. Bender
- Asymptotic enumeration of sparse graphs with a minimum degree constraint
- High degree graphs contain large-star factors Dedicated to Laszlo Lovasz, for his 60th birthday
- Large independent sets in regular graphs of large girth and Nicholas Wormald
- A PTAS for the Sparsest 2-Spanner Problem in 4-Connected Planar
- Decline design in underground mines using constrained path optimisation
- Optimisation in the design of underground mine access M Brazil, D Lee, J H Rubinstein, D A Thomas, J F Weng and N C Wormald
- Models of random regular graphs N. C. Wormald
- The differential equation method for random graph processes and greedy algorithms
- THE DEGREE SEQUENCE OF A RANDOM GRAPH I. THE MODELS
- Short cycle distribution in random regular graphs recursively generated by pegging
