✦ LIBER ✦

On hamiltonian Toeplitz graphs

✍ Scribed by Clemens Heuberger

Book ID: 108315647
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 332 KB
Volume: 245
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(01)00136-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian properties of Toeplitz graph

Hamiltonian properties of Toeplitz graphs

✍ René van Dal; Gert Tijssen; Zsolt Tuza; Jack A.A. van der Veen; Christina Zamfir 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 524 KB

Conditions are given for the existence of hamiltonian paths and cycles in the so-called Toeplitz graphs, i.e. simple graphs with a symmetric Toeplitz adjacency matrix.

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 n-hamiltonian graphs

✍ Linda Lesmak 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 598 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.

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.