𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs

✍ Scribed by Bing Wei

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
74 KB
Volume
75
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

A short proof of a theorem on Hamiltonia
A short proof of a theorem on Hamiltonian graphs
✍ Ainouche, A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB 👁 2 views

In this note, w e give a short proof of a stronger version of the following theorem: Let G be a 2-connected graph of order n such that for any independent set {u, u , w}, then G is hamiltonian. 0 1996 John

Landau's inequalities for tournament sco
Landau's inequalities for tournament scores and a short proof of a theorem on transitive sub-tournaments
✍ Richard A. Brualdi; Jian Shen 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

Ao and Hanson, and Guiduli, Gya  rfa  s, Thomasse  and Weidl independently, proved the following result: For any tournament score sequence S (s 1 , s 2 ,F F F,s n ) with s 1 s 2 Á Á Á s n , there exists a tournament T on vertex set f1Y 2Y F F F Y ng such that the score of each vertex i is s i an