✦ LIBER ✦

Fan type condition and characterization of Hamiltonian graphs

✍ Scribed by Chao, Kewen; Song, Chunwei; Zhang, Ping

Book ID: 124171246
Publisher: American Mathematical Society
Year: 2014
Tongue: English
Weight: 185 KB
Volume: 142
Category: Article
ISSN: 0002-9939
DOI: 10.1090/S0002-9939-2014-11977-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dirac type condition and Hamiltonian-con

Dirac type condition and Hamiltonian-connected graphs

✍ Chen, Deqin; Li, Zu; Zhao*, Kewen 📂 Article 📅 2011 🏛 Taylor and Francis Group 🌐 English ⚖ 183 KB

Disjoint Hamiltonian cycles in fan 2k-ty

Disjoint Hamiltonian cycles in fan 2k-type graphs

✍ Zhou Sanming 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB

## Abstract It is conjectured that a 2(__k__ + 1)‐connected graph of order __p__ contains __k__ + 1 pairwise disjoint Hamiltonian cycles if no two of its vertices that have degree less than 1/2 + 2__k__ are distance two apart. This is proved in detail for __k__ = 1. Similar arguments establish the

A chvátal–erdős type condition for hamil

A chvátal–erdős type condition for hamiltonian graphs

✍ Xiaoyun Lu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 443 KB

A Fan Type Condition For Heavy Cycles in

A Fan Type Condition For Heavy Cycles in Weighted Graphs

✍ Shenggui Zhang; Hajo Broersma; Xueliang Li; Ligong Wang 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 111 KB

A generalization of Bondy's and Fan's su

A generalization of Bondy's and Fan's sufficient conditions for Hamiltonian graphs

✍ X. Liu; B. Wei 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 337 KB

One sufficient condition for hamiltonian

One sufficient condition for hamiltonian graphs

✍ Guantao Chen 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 1 views

## Abstract Let __G__ be a 2‐connected graph of order __n.__ We show that if for each pair of nonadjacent vertices __x__,__y__ ∈ __V(G)__, then __G__ is Hamiltonian.