𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cycles through three vertices in 2-connected graphs

✍ Scribed by S. C. Locke; Cun-Quan Zhang

Publisher
Springer Japan
Year
1991
Tongue
English
Weight
331 KB
Volume
7
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cycles passing through k + 1 vertices in
Cycles passing through k + 1 vertices in k-connected graphs
✍ Jun Fujisawa; Tomoki Yamashita πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 149 KB πŸ‘ 1 views

## Abstract In this article, we prove the following theorem. Let __k__ β‰₯ 3 be an integer, __G__ be a __k__‐connected graph with minimum degree __d__ and __X__ be a set of __k__ + 1 vertices on a cycle. Then __G__ has a cycle of length at least min {2d,|V(G)|} passing through __X__. This result give

Cycles containing 12 vertices in 3-conne
Cycles containing 12 vertices in 3-connected cubic graphs
✍ Sheng Bau; Derek Holton πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 436 KB

## Abstract A necessary and sufficient condition is obtained for a set of 12 vertices in any 3‐connected cubic graph to lie on a common cycle.