Nicholas C. Wormald

Random Struct. Algorithms, January, 2025

2023

Asymptotic enumeration of digraphs and bipartite graphs by degree sequence.

[BibT_eX]

[DOI]

Anita Liebenau

Random Struct. Algorithms, March, 2023

2022

Component Games on Random Graphs.

[BibT_eX]

[DOI]

Comb., December, 2022

Semi-labeled unrooted binary tree optimization subject to nonnegativity.

[BibT_eX]

[DOI]

Seyed Soheil Hosseini

Networks, 2022

Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence.

[BibT_eX]

[DOI]

Proceedings of the 24th Symposium on Algorithm Engineering and Experiments, 2022

2021

Full rainbow matchings in graphs and hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

Linear-time uniform generation of random sparse contingency tables with specified marginals.

[BibT_eX]

[DOI]

Andrii Arman

CoRR, 2021

2020

The height of depth-weighted random recursive trees.

[BibT_eX]

[DOI]

Kevin Leckey

Dieter Mitsche

Random Struct. Algorithms, 2020

Almost all 5-regular graphs have a 3-flow.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Optimal Tree of a Complete Weighted Graph.

[BibT_eX]

[DOI]

Seyed Soheil Hosseini

Tianhai Tian

Proceedings of the Recent Advances in Computational Optimization, 2020

On Finding the Optimal Tree of a Complete Weighted Graph.

[BibT_eX]

[DOI]

Seyed Soheil Hosseini

Tianhai Tian

Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020

2019

Meyniel's conjecture holds for random d-regular graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

A Limit Theorem for the Six-length of Random Functional Graphs with a Fixed Degree Sequence.

[BibT_eX]

[DOI]

Kevin Leckey

Electron. J. Comb., 2019

Fast Uniform Generation of Random Graphs with Given Degree Sequences.

[BibT_eX]

[DOI]

Andrii Arman

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph.

[BibT_eX]

[DOI]

Dudley Stark

Comb. Probab. Comput., 2018

The Number of Satisfying Assignments of Random Regular k-SAT Formulas.

[BibT_eX]

[DOI]

Amin Coja-Oghlan

Comb. Probab. Comput., 2018

Local Algorithms, Regular Graphs of Large Girth, and Random Regular Graphs.

[BibT_eX]

[DOI]

Carlos Hoppen

Comb., 2018

Uniform generation of random graphs with power-law degree sequences.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

On the Push&Pull Protocol for Rumor Spreading.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Minimum Power Dominating Sets of Random Cubic Graphs.

[BibT_eX]

[DOI]

Liying Kang

J. Graph Theory, 2017

2016

Meyniel's conjecture holds for random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

The threshold for combs in random graphs.

[BibT_eX]

[DOI]

Jeff Kahn

Eyal Lubetzky

Random Struct. Algorithms, 2016

Properties of regular graphs with large girth via local algorithms.

[BibT_eX]

[DOI]

Carlos Hoppen

J. Comb. Theory B, 2016

Longest paths in random Apollonian networks and largest r-ary subtrees of random d-ary recursive trees.

[BibT_eX]

[DOI]

Andrea Collevecchio

Abbas Mehrabian

J. Appl. Probab., 2016

2015

Orientability Thresholds for Random Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

On the Push&Pull Protocol for Rumour Spreading: [Extended Abstract].

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Uniform Generation of Random Regular Graphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs.

[BibT_eX]

[DOI]

Brett Kolesnik

SIAM J. Discret. Math., 2014

On longest paths and diameter in random apollonian network.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2014

The mixing time of the giant component of a random graph.

[BibT_eX]

[DOI]

Itai Benjamini

Gady Kozma

Random Struct. Algorithms, 2014

The evolution and structure of social networks.

[BibT_eX]

[DOI]

Whitman Richards

Netw. Sci., 2014

On the push&pull protocol for rumour spreading.

[BibT_eX]

[DOI]

CoRR, 2014

It's a Small World for Random Surfers.

[BibT_eX]

[DOI]

Abbas Mehrabian

Proceedings of the Approximation, 2014

2013

An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph.

[BibT_eX]

[DOI]

Graeme Kemkes

SIAM J. Discret. Math., 2013

Asymptotic enumeration of strongly connected digraphs by vertices and edges.

[BibT_eX]

[DOI]

Xavier Pérez-Giménez

Random Struct. Algorithms, 2013

Asymptotic enumeration of sparse 2-connected graphs.

[BibT_eX]

[DOI]

Graeme Kemkes

Cristiane M. Sato

Random Struct. Algorithms, 2013

On the Longest Paths and the Diameter in Random Apollonian Networks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

On the Stretch Factor of Randomly Embedded Random Graphs.

[BibT_eX]

[DOI]

Abbas Mehrabian

Discret. Comput. Geom., 2013

2012

Gradient-Constrained Minimum Networks. III. Fixed Topology.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2012

Cores of random r-partite hypergraphs.

[BibT_eX]

[DOI]

Fabiano C. Botelho

Nivio Ziviani

Inf. Process. Lett., 2012

Induced subgraphs in sparse random graphs with given degree sequences.

[BibT_eX]

[DOI]

Yi Su

Eur. J. Comb., 2012

2011

Regular induced subgraphs of a random Graph.

[BibT_eX]

[DOI]

Michael Krivelevich

Benny Sudakov

Random Struct. Algorithms, 2011

Disjoint Hamilton cycles in the random geometric graph.

[BibT_eX]

[DOI]

Tobias Müller

Xavier Pérez-Giménez

J. Graph Theory, 2011

Geodesics and almost geodesic cycles in random regular graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Pegging Graphs Yields a Small Diameter.

[BibT_eX]

[DOI]

Stefanie Gerke

Angelika Steger

Comb. Probab. Comput., 2011

On the threshold for k-regular subgraphs of random graphs.

[BibT_eX]

[DOI]

Jacques Verstraëte

Comb., 2011

2010

The Diameter of Sparse Random Graphs.

[BibT_eX]

[DOI]

Oliver Riordan

Comb. Probab. Comput., 2010

Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

Asymptotics of Some Convolutional Recurrences.

[BibT_eX]

[DOI]

Adri B. Olde Daalhuis

Electron. J. Comb., 2010

Load balancing and orientability thresholds for random hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

2009

Short cycle distribution in random regular graphs recursively generated by pegging.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

On the chromatic number of a random 5-regular graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2009

Rate of Convergence of the Short Cycle Distribution in Random Regular Graphs Generated by Pegging.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

Representing Small Group Evolution.

[BibT_eX]

[DOI]

Whitman Richards

Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, 2009

2008

Walkers on the Cycle and the Grid.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Cleaning Regular Graphs with Brushes.

[BibT_eX]

[DOI]

Noga Alon

SIAM J. Discret. Math., 2008

Distribution of subgraphs of random regular graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

Corrigendum to "Counting connected graphs inside-out" [J. Combin. Theory Ser. B 93 (2005) 127-172].

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Expansion properties of a random regular graph after random vertex deletions.

[BibT_eX]

[DOI]

Fred B. Holt

Eur. J. Comb., 2008

Large forbidden trade volumes and edge packings of random graphs.

[BibT_eX]

[DOI]

Sanming Zhou

Discret. Math., 2008

Induced Forests in Regular Graphs with Large Girth.

[BibT_eX]

[DOI]

Carlos Hoppen

Comb. Probab. Comput., 2008

2007

Bounds on the bisection width for random d -regular graphs.

[BibT_eX]

[DOI]

Josep Díaz

Maria J. Serna

Theor. Comput. Sci., 2007

Hamiltonicity of random graphs produced by 2-processes.

[BibT_eX]

[DOI]

András Telcs

Sanming Zhou

Random Struct. Algorithms, 2007

Rainbow Hamilton cycles in random regular graphs.

[BibT_eX]

[DOI]

Svante Janson

Random Struct. Algorithms, 2007

Large independent sets in regular graphs of large girth.

[BibT_eX]

[DOI]

Joseph Lauer

J. Comb. Theory B, 2007

Network modelling of underground mine layout: two case studies.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2007

Growing Protean Graphs.

[BibT_eX]

[DOI]

Internet Math., 2007

Colouring Random Regular Graphs.

[BibT_eX]

[DOI]

Lingsheng Shi

Comb. Probab. Comput., 2007

Colouring Random 4-Regular Graphs.

[BibT_eX]

[DOI]

Lingsheng Shi

Comb. Probab. Comput., 2007

Birth control for giants.

[BibT_eX]

[DOI]

Joel H. Spencer

Comb., 2007

Constrained Path Optimisation for Underground Mine Layout.

[BibT_eX]

Marcus Brazil

Peter Alexander Grossman

Proceedings of the World Congress on Engineering, 2007

The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation.

[BibT_eX]

[DOI]

Julie Anne Cain

Peter Sanders

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm.

[BibT_eX]

[DOI]

Margaret-Ellen Messinger

Richard J. Nowakowski

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007

2006

The generalized acyclic edge chromatic number of random regular graphs.

[BibT_eX]

[DOI]

Stefanie Gerke

J. Graph Theory, 2006

Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees.

[BibT_eX]

[DOI]

J. Hyam Rubinstein

Jia F. Weng

J. Glob. Optim., 2006

3-star factors in random d-regular graphs.

[BibT_eX]

[DOI]

Hilda Assiyatun

Eur. J. Comb., 2006

On the Independent Domination Number of Random Regular Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2006

Encores on Cores.

[BibT_eX]

[DOI]

Julie Cain

Electron. J. Comb., 2006

Analysis of Algorithms on the Cores of Random Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2006

2005

The acyclic edge chromatic number of a random d-regular graph is d + 1.

[BibT_eX]

[DOI]

Jaroslav Nesetril

J. Graph Theory, 2005

Counting connected graphs inside-out.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

Random k-Sat: A Tight Threshold For Moderately Growing k.

[BibT_eX]

[DOI]

Alan M. Frieze

Comb., 2005

Connectivity for Wireless Agents Moving on a Cycle or Grid.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

2004

Avoidance of a giant component in half the edge set of a random graph.

[BibT_eX]

[DOI]

Tom Bohman

Alan M. Frieze

Random Struct. Algorithms, 2004

Hamiltonian decompositions of random bipartite regular graphs.

[BibT_eX]

[DOI]

Jeong Han Kim

J. Comb. Theory B, 2004

To Adrian Bondy and U. S. R. Murty.

[BibT_eX]

[DOI]

William H. Cunningham

J. Comb. Theory B, 2004

Random Hypergraph Processes with Degree Restrictions.

[BibT_eX]

[DOI]

Andrzej Rucinski

Graphs Comb., 2004

Short Cycles in Random Regular Graphs.

[BibT_eX]

[DOI]

Beata Wysocka

Electron. J. Comb., 2004

Computation of the Bisection Width for Random d-Regular Graphs.

[BibT_eX]

[DOI]

Josep Díaz

Maria J. Serna

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003

Bounds on the max and min bisection of random cubic and random 4-regular graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

On the probability of independent sets in random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2003

A PTAS for the sparsest 2-spanner of 4-connected planar triangulations.

[BibT_eX]

[DOI]

Michele Zito

J. Discrete Algorithms, 2003

Asymptotic enumeration of sparse graphs with a minimum degree constraint.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2003

Enumeration of P 4-Free Chordal Graphs.

[BibT_eX]

[DOI]

Robert Castelo

Graphs Comb., 2003

Analysis of greedy algorithms on graphs with bounded degrees.

[BibT_eX]

[DOI]

Discret. Math., 2003

Connectedness Of The Degree Bounded Star Process.

[BibT_eX]

[DOI]

Andrzej Rucinski

Comb. Probab. Comput., 2003

Sharp Concentration of the Number of Submaps in Random Planar Triangulations.

[BibT_eX]

[DOI]

Comb., 2003

Analytic Graph Theory.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Graph Theory., 2003

2002

Minimum independent dominating sets of random cubic graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

Decycling numbers of random regular graphs.

[BibT_eX]

[DOI]

Sheng Bau

Sanming Zhou

Random Struct. Algorithms, 2002

Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2002

Permutation Pseudographs And Contiguity.

[BibT_eX]

[DOI]

Svante Janson

Jeong Han Kim

Comb. Probab. Comput., 2002

The Number of Labeled 2-Connected Planar Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2002

Bisection of Random Cubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

2001

Hamilton cycles containing randomly selected edges in random regular graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

Random regular graphs of high degree.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

A polynomial algorithm for a constrained traveling salesman problem.

[BibT_eX]

[DOI]

J. Hyam Rubinstein

Doreen A. Thomas

Networks, 2001

Counting 5-connected planar triangulations.

[BibT_eX]

[DOI]

J. Graph Theory, 2001

Gradient-constrained minimum networks. I. Fundamentals.

[BibT_eX]

[DOI]

J. Glob. Optim., 2001

Regular Graphs with No Homomorphisms onto Cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs.

[BibT_eX]

[DOI]

Jeong Han Kim

J. Comb. Theory B, 2001

Linear Arboricity and Linear k-Arboricity of Regular Graphs.

[BibT_eX]

[DOI]

Noga Alon

Vanessa Teague

Graphs Comb., 2001

2000

The Distribution of the Maximum Vertex Degree in Random Planar Maps.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2000

The asymptotic number of graphs with a restriction on the maximum degree.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding Given Subtrees.

[BibT_eX]

[DOI]

Meei Pyng Ng

Mike A. Steel

Discret. Appl. Math., 2000

Random Star Processes.

[BibT_eX]

[DOI]

Hanna D. Robalewska

Comb. Probab. Comput., 2000

Covering regular graphs with forests of small trees.

[BibT_eX]

[DOI]

Hilda Assiyatun

Australas. J Comb., 2000

Maximum Induced Matchings of Random Cubic Graphs.

[BibT_eX]

[DOI]

Michele Zito

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

The Size of the Largest Components in Random Planar Maps.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1999

Generating Random Regular Graphs Quickly.

[BibT_eX]

[DOI]

Angelika Steger

Comb. Probab. Comput., 1999

The Asymptotic Number of Set Partitions with Unequal Block Sizes.

[BibT_eX]

[DOI]

Electron. J. Comb., 1999

1998

Factorisation of regular graphs into forests of short paths.

[BibT_eX]

[DOI]

Terri Lindquester

Discret. Math., 1998

More on the linear k-arboricity of regular graphs.

[BibT_eX]

[DOI]

Robert E. L. Aldred

Australas. J Comb., 1998

A Tree-Based Mergesort.

[BibT_eX]

[DOI]

Alistair Moffat

Ola Petersson

Acta Informatica, 1998

Geometric Separator Theorems & Applications.

[BibT_eX]

[DOI]

Warren D. Smith

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Steiner Trees for Terminals Constrained to Curves.

[BibT_eX]

[DOI]

J. Hyam Rubinstein

Doreen A. Thomas

SIAM J. Discret. Math., 1997

1-Factorizations of random regular graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1997

The degree sequence of a random graph. I. The models.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1997

Asymptotic Enumeration of Convex Polygons.

[BibT_eX]

[DOI]

Dudley Stark

J. Comb. Theory A, 1997

Full Minimal Steiner Trees on Lattice Sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1997

Minimal Steiner Trees for Rectangular Arrays of Lattice Points.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1997

Shortest networks on spheres.

[BibT_eX]

[DOI]

Proceedings of the Network Design: Connectivity and Facilities Location, 1997

1996

The perturbation method and triangle-free random graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

Sudden Emergence of a Giantk-Core in a Random Graph.

[BibT_eX]

[DOI]

Joel Spencer

J. Comb. Theory B, 1996

Minimal Steiner Trees for 2k×2k Square Lattices.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1996

Generating and Counting Hamilton Cycles in Random Regular Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1996

On the linear k-arboricity of cubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

Reconstruction of Rooted Trees From Subtrees.

[BibT_eX]

[DOI]

Meei Pyng Ng

Discret. Appl. Math., 1996

A Family of Perfect Hashing Methods.

[BibT_eX]

[DOI]

Comput. J., 1996

1995

Largest 4-Connected Components of 3-Connected Planar Triangulations.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1995

Almost All Maps Are Asymmetric.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K1, d-Free Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

1994

Almost All Regular Graphs Are Hamiltonian.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1994

Spanning eulerian subgraphs of bounded degree in triangulations.

[BibT_eX]

[DOI]

Graphs Comb., 1994

Edge Crossings in Drawings of Bipartite Graphs.

[BibT_eX]

[DOI]

Peter Eades

Algorithmica, 1994

1993

Infinite highly arc transitive digraphs and universal covering digraphs.

[BibT_eX]

[DOI]

Peter J. Cameron

Cheryl E. Praeger

Comb., 1993

Performance Guarantees for Motion Planning with Temporal Uncertainty.

[BibT_eX]

Peter Eades

Xuemin Lin

Aust. Comput. J., 1993

Graphs, Hypergraphs and Hashing.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992

Almost All Cubic Graphs Are Hamiltonian.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1992

Enumeration of Almost-Convex Polygons on the Square Lattice.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1992

Longest cycles in 3-connected planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1992

Random Graph Processes with Degree Restrictions.

[BibT_eX]

[DOI]

Andrzej Rucinski

Comb. Probab. Comput., 1992

Sorting and/by Merging Finger Trees.

[BibT_eX]

[DOI]

Alistair Moffat

Ola Petersson

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991

Asymptotic enumeration by degree sequence of graphs with degress o(n1/2).

[BibT_eX]

[DOI]

Comb., 1991

1990

On the Distribution of Lengths of Evolutionary Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

Cycles containing matchings and pairwise compatible euler tours.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

Removable edges in 3-connected graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

Uniform Generation of Random Regular Graphs of Moderate Degree.

[BibT_eX]

[DOI]

J. Algorithms, 1990

Asymptotic Enumeration by Degree Sequence of Graphs of High Degree.

[BibT_eX]

[DOI]

Eur. J. Comb., 1990

Fixed edge-length graph drawing is NP-hard.

[BibT_eX]

[DOI]

Peter Eades

Discret. Appl. Math., 1990

k-walks of graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 1990

1989

Bounds on the measurable chromatic number of Rn.

[BibT_eX]

[DOI]

László A. Székely

Discret. Math., 1989

1988

The asymptotic number of rooted nonseparable maps on a surface.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1988

Random Triangulations of the Plane.

[BibT_eX]

[DOI]

Eur. J. Comb., 1988

1987

Generating Random Unlabelled Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1987

Ménage numbers, bijections and P-recursiveness.

[BibT_eX]

[DOI]

E. Rodney Canfield

Discret. Math., 1987

Optimal Worst Case Trees.

[BibT_eX]

[DOI]

Cheryl E. Praeger

Acta Informatica, 1987

1986

Extremal clique coverings of complementary graphs.

[BibT_eX]

[DOI]

Comb., 1986

The asymptotic number of acyclic diagraphs I.

[BibT_eX]

[DOI]

Comb., 1986

1985

Enumeration of cyclically 4-connected cubic graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1985

Cataloguing the graphs on 10 vertices.

[BibT_eX]

[DOI]

J. Graph Theory, 1985

Regular factors of regular graphs.

[BibT_eX]

[DOI]

Béla Bollobás

Akira Saito

J. Graph Theory, 1985

Counting labelled chordal graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1985

The number of loopless planar maps.

[BibT_eX]

[DOI]

Discret. Math., 1985

1984

Isomorphic factorizations VII. Regular graphs and tournaments.

[BibT_eX]

[DOI]

J. Graph Theory, 1984

Generating Random Regular Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1984

Automorphisms of random graphs with specified vertices.

[BibT_eX]

[DOI]

Comb., 1984

1983

Numbers of cubic graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1983

1981

Counting the 10-point graphs by partition.

[BibT_eX]

[DOI]

Ronald C. Read

J. Graph Theory, 1981

The asymptotic distribution of short cycles in random regular graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1981

The asymptotic connectivity of labelled regular graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1981

Counting unrooted planar maps.

[BibT_eX]

[DOI]

Discret. Math., 1981

1980

Number of labeled 4-regular graphs.

[BibT_eX]

[DOI]

Ronald C. Read

J. Graph Theory, 1980

1979

The exponential generating function of labelled blocks.

[BibT_eX]

[DOI]

Edward M. Wright

Discret. Math., 1979

1978

Achiral plane trees.

[BibT_eX]

[DOI]

J. Graph Theory, 1978

1977

Counting labelled 3-connected graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1977

The divisibility theorem for isomorphic factorizations of complete graphs.

[BibT_eX]

[DOI]

Frank Harary