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: | , |
|---|---|
| Format: | Journal article |
| Published: |
Cambridge University Press
2017
|