✦ LIBER ✦

Hamiltonian uniform subset graphs

✍ Scribed by Bor-Liang Chen; Ko-Wei Lih

Book ID: 107884258
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 330 KB
Volume: 42
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(87)90044-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian circuits and paths in subset

Hamiltonian circuits and paths in subset graphs with circular adjacency

✍ T.C. Enns 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 751 KB

Consider the subset graph G(n, k) whose vertex set C(n, k) is the set of all n-tuples of 'O's' and 'l's' with exactly k 'I's'. Let an edge exist between two vertices a and b in G(n,k) if and only if a can be transformed into b by the interchange of two adjacent coordinate values, with the first and

Hamiltonian threshold graphs

✍ Frank Harary; Uri Peled 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Hamiltonian Kneser Graphs

✍ Ya-Chen Chen; Z. Füredi 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 99 KB

Hamiltonian pancyclic graphs

✍ Denise Amar; Evelyne Flandrin; Irène Fournier; Anne Germa 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 79 KB

Locally Hamiltonian graphs

✍ D. Katona; A. Kostochka; Ya. Pykh; B. Stechkin 📂 Article 📅 1989 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 282 KB

Directed hamiltonian graphs

✍ Yannis Manoussakis 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

## Abstract We give a new condition involving degrees sufficient for a digraph to be hamiltonian.