✦ LIBER ✦

On the construction and enumeration of Hamiltonian graphs

✍ Scribed by Hu Guanzhang; Li Minshan

Book ID: 112818053
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 1993
Tongue: English
Weight: 216 KB
Volume: 8
Category: Article
ISSN: 1005-1031
DOI: 10.1007/bf02661988

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Construction of maximally non-Hamiltonia

Construction of maximally non-Hamiltonian graphs

✍ Roldugin, P.V. 📂 Article 📅 2003 🏛 Walter de Gruyter GmbH & Co. KG 🌐 English ⚖ 127 KB

On the construction of combined k-fault-

On the construction of combined k-fault-tolerant Hamiltonian graphs

✍ Chun-Nan Hung; Lih-Hsing Hsu; Ting-Yi Sung 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

Enumeration of Hamiltonian cycles in cer

Enumeration of Hamiltonian cycles in certain generalized Petersen graphs

✍ Allen J Schwenk 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 497 KB

Canonical indexing and constructive enum

Canonical indexing and constructive enumeration of molecular graphs

✍ Kvasnicka, Vladimir; Pospichal, Jiri 📂 Article 📅 1990 🏛 American Chemical Society 🌐 English ⚖ 863 KB

Construction schemes for fault-tolerant

Construction schemes for fault-tolerant Hamiltonian graphs

✍ Wang, Jeng-Jung; Hung, Chun-Nan; Tan, Jimmy J. M.; Hsu, Lih-Hsing; Sung, Ting-Yi 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB 👁 2 views

In this paper, we present three construction schemes for fault-tolerant Hamiltonian graphs. We show that applying these construction schemes on fault-tolerant Hamiltonian graphs generates graphs preserving the original Hamiltonicity property. We apply these construction schemes to generate some know

An improved method of constructive enume

An improved method of constructive enumeration of graphs

✍ V. Kvasnička; J. Pospíchal 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 953 KB