Connectivity of addable graph classes
From MaRDI portal
Publication:2483480
DOI10.1016/J.JCTB.2007.09.003zbMATH Open1145.05033OpenAlexW1998162291MaRDI QIDQ2483480FDOQ2483480
Authors: Béla Bollobás, Stefanie Gerke, Paul Balister 
Publication date: 28 April 2008
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.09.003
Recommendations
- On the connectivity of random graphs from addable classes
- Connectivity for Bridge-addable monotone graph classes
- Connectivity of addition Cayley graphs
- Connectivity of random addable graphs
- The Connectivity of addition Cayley graphs
- Relatively Bridge-Addable Classes of Graphs
- Connectivity for bridge-alterable graph classes
- Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture
- Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture
- scientific article; zbMATH DE number 4023324
Cites Work
Cited In (11)
- Connectivity for bridge-alterable graph classes
- Bridge-addability, edge-expansion and connectivity
- Connectivity of random addable graphs
- Longest and shortest cycles in random planar graphs
- Logical properties of random graphs from small addable classes
- Local convergence and stability of tight bridge-addable classes
- Random graphs from a minor-closed class
- Connectivity for Bridge-addable monotone graph classes
- The Evolution of Random Graphs on Surfaces
- Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture
- Relatively Bridge-Addable Classes of Graphs
This page was built for publication: Connectivity of addable graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483480)
