Bridge-addability, edge-expansion and connectivity
A class of graphs is called bridge-addable if, for each graph in the class and each pair u and v of vertices in different components, the graph obtained by adding an edge joining u and v must also be in the class. The concept was introduced in 2005 by McDiarmid, Steger and Welsh, who showed that, fo...
Main Authors: | McDiarmid, C, Weller, K |
---|---|
Format: | Journal article |
Published: |
Cambridge University Press
2017
|
Similar Items
-
Connectivity for bridge-addable monotone graph classes
by: Berry, L, et al.
Published: (2011) -
Connectivity for random graphs from a weighted bridge-addable class
by: McDiarmid, C
Published: (2012) -
Connectivity for bridge-alterable graph classes
by: McDiarmid, C
Published: (2013) -
Logical properties of random graphs from small addable classes
by: Anuj Dawar, et al.
Published: (2019-07-01) -
On the Number of Edges in Random Planar Graphs.
by: Gerke, S, et al.
Published: (2004)