𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Single-source three-disjoint path covers in cubes of connected graphs

✍ Scribed by Park, Jung-Heum; Ihm, Insung

Book ID
122735734
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
207 KB
Volume
113
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Covering contractible edges in 3-connect
Covering contractible edges in 3-connected graphs. I: Covers of size three are cutsets
✍ Akira Saito πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 397 KB πŸ‘ 1 views

## Abstract An edge of a 3‐connected graph is said to be __contractible__ if its contraction results in a 3‐connected graph. In this paper, a covering of contractible edges is studied. We give an alternative proof to the result of Ota and Saito (__Scientia__ (A) 2 (1988) 101–105) that the set of co

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.