𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs

✍ Scribed by Shuya Chiba; Shinya Fujita; Yunshu Gao; Guojun Li

Book ID
106047837
Publisher
Springer Japan
Year
2010
Tongue
English
Weight
217 KB
Volume
26
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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__~__

A Degree Sum Condition for the Existence
A Degree Sum Condition for the Existence of a Contractible Edge in a ΞΊ-Connected Graph
✍ Matthias Kriesell πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 184 KB

It is known that a noncomplete }-connected graph of minimum degree of at least w 5} 4 x contains a }-contractible edge, i.e., an edge whose contraction yields again a }-connected graph. Here we prove the stronger statement that a noncomplete }-connected graph for which the sum of the degrees of any