Connectivity for bridge-alterable graph classes
A collection of graphs is called bridge-alterable if, for each graph G with a bridge e, G is in the class if and only if G-e is. For example the class of forests is bridge-alterable. For a random forest $F_n$ sampled uniformly from the set of forests on vertex set {1,..,n}, a classical result of Ren...
| 主要作者: | |
|---|---|
| 格式: | Journal article |
| 出版: |
ArXiv
2013
|