✦ LIBER ✦

Degree Sums and Path-Factors in Graphs

✍ Scribed by Yaojun Chen; Feng Tian; Bing Wei

Book ID: 105745130
Publisher: Springer Japan
Year: 2001
Tongue: English
Weight: 146 KB
Volume: 17
Category: Article
ISSN: 0911-0119
DOI: 10.1007/pl00007239

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree sums,k-factors and hamilton cycle

Degree sums,k-factors and hamilton cycles in graphs

✍ R. J. Faudree; J. van den Heuvel 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 431 KB

Longest Paths and Longest Cycles in Grap

Longest Paths and Longest Cycles in Graphs with Large Degree Sums

✍ Ingo Schiermeyer; Meike Tewes 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 139 KB

Degree sums, connectivity and dominating

Degree sums, connectivity and dominating cycles in graphs

✍ Sun Zhiren; Tian Feng; Wei Bing 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 63 KB

Degree Sums, Connectivity and Dominating

Degree Sums, Connectivity and Dominating Cycles in Graphs

✍ Zhiren Sun; Feng Tian; Bing Wei 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 124 KB

Relative length of long paths and cycles

Relative length of long paths and cycles in graphs with large degree sums

✍ Hikoe Enomoto; Jan van den Heuvel; Atsushi Kaneko; Akira Saito 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 601 KB

## Abstract For a graph __G, p__(__G__) denotes the order of a longest path in __G__ and __c__(__G__) the order of a longest cycle. We show that if __G__ is a connected graph __n__ ≥ 3 vertices such that __d__(__u__) + __d__(__v__) + __d__(__w__) ≧ n for all triples __u, v, w__ of independent verti

On path factors in certain graphs of mix

On path factors in certain graphs of mixed degree 2 and 3

✍ Jack L Hursch Jr. 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 290 KB