𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An included-minor result for 3-connected graphs with contractible edges

✍ Scribed by Galen E. Turner III

Book ID
108316430
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
68 KB
Volume
214
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Covering contractible edges in 3-connect
Covering contractible edges in 3-connected graphs. II. Characterizing those with covers of size three
✍ Robert L. Hemminger; Xingxing Yu πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 272 KB πŸ‘ 1 views

## Abstract It is shown that if __G__ is a 3‐connected graph with |__V(G)__| β‰₯ 10, then, with the exception of one infinite class based on __K__~3,__p__~, it takes at least four vertices to cover the set of contractible edges of __G__. Β© 1993 John Wiley & Sons, Inc.

3-connected graphs with non-cut contract
3-connected graphs with non-cut contractible edge covers of size k
✍ Xingxing Yu πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 493 KB πŸ‘ 1 views

## Abstract In this paper, we show that if a 3‐connected graph __G__ other than __K__~4~ has a vertex subset __K__ that covers the set of contractible edges of __G__ and if |__K__| 3 and |__V(G)__| 3|__K__| βˆ’ 1, then __K__ is a cutset of __G__. We also give examples to show that this result is best

An algorithm for construction of a k-con
An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter
✍ Ulrich Schumacher πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will