Bridge-addability, edge-expansion and connectivity
From MaRDI portal
Publication:5366969
DOI10.1017/S0963548317000128zbMATH Open1371.05271OpenAlexW2612505988MaRDI QIDQ5366969FDOQ5366969
Authors: Kerstin Weller, Colin 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
Recommendations
- Relatively Bridge-Addable Classes of Graphs
- Connectivity for random graphs from a weighted bridge-addable class
- Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture
- Connectivity for Bridge-addable monotone graph classes
- On the connectivity of random graphs from addable classes
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Connectivity (05C40)
Cites Work
- Analytic combinatorics
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Paths in graphs
- Random graphs from a 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 of addable graph classes
- Connectivity for Bridge-addable monotone graph classes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Enumeration of Point Labelled Chromatic Graphs and Trees
- Random graphs from a weighted minor-closed class
- LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 -- April 4, 2014. Proceedings
- Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture
Cited In (3)
This page was built for publication: Bridge-addability, edge-expansion and connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366969)
