✦ LIBER ✦

On n-hamiltonian graphs

✍ Scribed by Linda Lesmak

Book ID: 107748216
Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 598 KB
Volume: 14
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(76)90059-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On n-Hamiltonian line graphs

✍ Linda Lesniak-Foster 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 853 KB

Hamiltonian cycles in n-extendable graph

Hamiltonian cycles in n-extendable graphs

✍ Ken-ichi Kawarabayashi; Katsuhiro Ota; Akira Saito 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

## Abstract A graph __G__ of order at least 2__n__+2 is said to be __n__‐extendable if __G__ has a perfect matching and every set of __n__ independent edges extends to a perfect matching in __G__. We prove that every pair of nonadjacent vertices __x__ and __y__ in a connected __n__‐extendable graph

On critically hamiltonian graphs

✍ Linda Lesniak-Foster 📂 Article 📅 1977 🏛 Akadmiai Kiad 🌐 English ⚖ 216 KB

On Hamiltonian bipartite graphs

✍ J. Moon; L. Moser 📂 Article 📅 1963 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 133 KB

On hamiltonian Toeplitz graphs

✍ Clemens Heuberger 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 332 KB

On F-Hamiltonian graphs

✍ Zhenqi Yang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 390 KB

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.