𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Fan Type Condition For Heavy Cycles in Weighted Graphs

✍ Scribed by Shenggui Zhang; Hajo Broersma; Xueliang Li; Ligong Wang

Book ID
106048102
Publisher
Springer Japan
Year
2002
Tongue
English
Weight
111 KB
Volume
18
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cycles in weighted graphs
Cycles in weighted graphs
✍ J. A. Bondy; Genghua Fan πŸ“‚ Article πŸ“… 1991 πŸ› Springer-Verlag 🌐 English βš– 602 KB
A degree sum condition for longest cycle
A degree sum condition for longest cycles in 3-connected graphs
✍ Tomoki Yamashita πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 110 KB πŸ‘ 1 views

## Abstract For a graph __G__, we denote by __d__~__G__~(__x__) and ΞΊ(__G__) the degree of a vertex __x__ in __G__ and the connectivity of __G__, respectively. In this article, we show that if __G__ is a 3‐connected graph of order __n__ such that __d__~__G__~(__x__) + __d__~__G__~(__y__) + __d__~__