𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A short proof for the Faudree-Schelp theorem on path-connected graphs

✍ Scribed by Cai Xiao-Tao

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
87 KB
Volume
8
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

In this note a shortened proof is given for the Faudree—Schelp theorem on path‐connected graphs.

📜 SIMILAR VOLUMES

A Short Proof of a Theorem Concerning De
A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs
✍ Bing Wei 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 74 KB

proved that if G is a 2-connected graph with n vertices such that d(u)+d(v)+d(w) n+} holds for any triple of independent vertices u, v, and w, then G is hamiltonian, where } is the vertex connectivity of G. In this note, we will give a short proof of the above result.