Bridge-Addability, Edge-Expansion and Connectivity

DOI10.1017/S0963548317000128zbMath1371.05271OpenAlexW2612505988MaRDI QIDQ5366969

Kerstin Weller, Colin J. H. McDiarmid

Publication date: 10 October 2017

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

Full work available at URL: https://doi.org/10.1017/s0963548317000128

zbMATH Keywords

countingbridge-addable graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random graphs from a weighted minor-closed class
• Random planar graphs
• On the connectivity of random graphs from addable classes
• Connectivity for random graphs from a weighted bridge-addable class
• Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture
• LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 -- April 4, 2014. Proceedings
• Connectivity of addable graph classes
• Connectivity for Bridge-Addable Monotone Graph Classes
• The Enumeration of Point Labelled Chromatic Graphs and Trees
• Random Graphs from a Minor-Closed Class
• Paths in graphs

This page was built for publication: Bridge-Addability, Edge-Expansion and Connectivity