✦ LIBER ✦

Hamiltonian cycles of a connected graph

✍ Scribed by L. M. Likhtenbaum

Publisher: Springer US
Year: 1968
Tongue: English
Weight: 291 KB
Volume: 4
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01071478

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum Number of Contractible Edges on

Maximum Number of Contractible Edges on Hamiltonian Cycles of a 3-Connected Graph

✍ Kyo Fujita 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 252 KB

Hamiltonian cycles in 3-connected claw-f

Hamiltonian cycles in 3-connected claw-free graphs

✍ MingChu Li 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 437 KB 👁 2 views

Hamiltonian cycles in 2-connected claw-f

Hamiltonian cycles in 2-connected claw-free-graphs

✍ Hao Li 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB 👁 2 views

## Abstract M. Matthews and D. Sumner have proved that of __G__ is a 2‐connected claw‐free graph of order __n__ such that δ ≧ (__n__ − 2)/3, then __G__ is hamiltonian. We prove that the bound for the minimum degree δ can be reduced to __n__/4 under the additional condition that __G__ is not in __F_

Every 4-Connected Line Graph of a Planar

Every 4-Connected Line Graph of a Planar Graph is Hamiltonian

✍ Hong-Jian Lai 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 217 KB

On hamiltonian-connected graphs

✍ Ronald J. Gould; Xingxing Yu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 735 KB

## Abstract One of the most fundamental results concerning paths in graphs is due to Ore: In a graph __G__, if deg __x__ + deg __y__ ≧ |__V__(__G__)| + 1 for all pairs of nonadjacent vertices __x, y__ ≅ __V__(__G__), then __G__ is hamiltonian‐connected. We generalize this result using set degrees.

Partition of a bipartite hamiltonian gra

Partition of a bipartite hamiltonian graph into two cycles

✍ Denise Amar 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 480 KB

We prove the following theorem. "I'neorem. If G is a balanced bipartite graph with bipartition (A, B), [A I = IBI = n, such that for any x ~ A, y ~ B, d(x) + d(y) >>-n + 2, then for any (nl, n2), ni >I 2, n -----n I + hE, G contains two independent cycles of lengths 2nl and 2n2.