✦ LIBER ✦

On F-Hamiltonian graphs

✍ Scribed by Zhenqi Yang

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 390 KB
Volume: 196
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00216-7

No coin nor oath required. For personal study only.

✦ Synopsis

Suppose G is a graph, F is a l-factor of G. G is called F-Hamiltonian, if there exists a Hamiltonian cycle containing F in G. In this paper, two necessary and sufficient conditions for a general graph and a bipartite graph being F-Hamiltonian are provided, respectively.

📜 SIMILAR VOLUMES

On hamiltonian line graphs

✍ Lane Clark 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 191 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.

On Hamiltonian-connected regular graphs

✍ Ioan Tomescu 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 360 KB

In this paper it is shown that any rn-regular graph of order 2rn (rn 3 3), not isomorphic to K, , , , or of order 2rn + 1 (rn even, rn 3 4), is Hamiltonian connected, which extends a previous result of Nash-Williams. As a corollary, it is derived that any such graph contains at least rn Hamiltonian

On graphs with hamiltonian squares

✍ P. Underground 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 111 KB

The problem of recognizing hamiltonian graphs is not Jriously difficult; in fack, Karp, Lawler and Tarjan [3] proved that it is NP-colnplete. Combined with Cook's theorem [l], this result suggests that the existence'= of a good characterization of nonhamiltcnian graphs is extremely unlikely. On the

On hamiltonian claw-free graphs

✍ E. Flandrin; J.L. Fouquet; H. Li 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 515 KB

We show that every 3-connected claw-free graphs having at most 5S-10 vertices is hamiltonian, where 6 is the minimum degree. For regular 3-connected claw-free graphs, a related result was obtained by Li and Liu (preprint), but for nonregular claw-free graphs the best-known result comes from the work

On edge-hamiltonian Cayley graphs

✍ Ulrike Baumann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 667 KB