The Degree Sequence of Random Graphs from Subcritical Classes

DOI10.1017/S0963548309990368zbMath1215.05156MaRDI QIDQ3552496

Angelika Steger, Nicla Bernasconi, Konstantinos D. Panagiotou

Publication date: 22 April 2010

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07)

Related Items

Maximum degree in minor-closed classes of graphs ⋮ Asymptotic Properties of Some Minor-Closed Classes of Graphs ⋮ The maximum degree of random planar graphs ⋮ Random graphs from a weighted minor-closed class ⋮ Exact-Size Sampling of Enriched Trees in Linear Time ⋮ Limits of random tree-like discrete structures ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ Degree distribution in random planar graphs ⋮ The Maximum Degree of Series-Parallel Graphs ⋮ Maximal independent sets and maximal matchings in series-parallel and related graph classes ⋮ Random graphs from a block-stable class ⋮ Subcritical Graph Classes Containing All Planar Graphs ⋮ Graph classes with given 3-connected components: Asymptotic enumeration and random graphs ⋮ Spanning trees in random series-parallel graphs

Cites Work

• Unnamed Item
• Counting labelled three-connected and homeomorphically irreducible two- connected graphs
• A calculus for the random generation of labelled combinatorial structures
• Random planar graphs
• On the maximum degree in a random tree
• Boltzmann Samplers for the Random Generation of Combinatorial Structures