Random graphs from a block-stable class
Authors:
- Colin McDiarmidCMColin McDiarmid
- Alex ScottASAlex Scott
- 1 November 2016
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 58, 96-106
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Maximum degree in minor-closed classes of graphsEuropean Journal of Combinatorics, 2016
- On the Diameter of Random Planar GraphsCombinatorics, Probability and Computing, 2014
- The maximum degree of random planar graphsProceedings of the London Mathematical Society, 2014
- Connectivity for Bridge-Addable Monotone Graph ClassesCombinatorics, Probability and Computing, 2012
- 3-Connected Cores In Random Planar GraphsCombinatorics, Probability and Computing, 2011
- Asymptotic Study of Subcritical Graph ClassesSIAM Journal on Discrete Mathematics, 2011
- The Degree Sequence of Random Graphs from Subcritical ClassesCombinatorics, Probability and Computing, 2009
- Asymptotic enumeration and limit laws of planar graphsJournal of the American Mathematical Society, 2008
- The maximum degree in a random tree and related problemsRandom Structures & Algorithms, 1994
- The average height of binary trees and other simple treesJournal of Computer and System Sciences, 1982