𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Categorical and contractible covers of polyhedra

✍ Scribed by Luis Montejano

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
968 KB
Volume
32
Category
Article
ISSN
0166-8641

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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