✦ LIBER ✦

On Hamiltonian cycles as optimal p-cycles

✍ Scribed by Schupke, D.A.

Book ID: 117885897
Publisher: IEEE
Year: 2005
Tongue: English
Weight: 475 KB
Volume: 9
Category: Article
ISSN: 1089-7798
DOI: 10.1109/lcomm.2005.1413634

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comments on "On Hamiltonian Cycles as Op

Comments on "On Hamiltonian Cycles as Optimal p-Cycles"

✍ Cholda, P. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 40 KB

On Hamiltonian cycles and Hamiltonian pa

On Hamiltonian cycles and Hamiltonian paths

✍ M. Sohel Rahman; M. Kaykobad 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 89 KB

A remark on Hamiltonian cycles

✍ Roland Häggkvist; G.G Nicoghossian 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 107 KB

Distributing vertices on Hamiltonian cyc

Distributing vertices on Hamiltonian cycles

✍ Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Colton Magnant 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

## Abstract Let __G__ be a graph of order __n__ and 3≤__t__≤__n__/4 be an integer. Recently, Kaneko and Yoshimoto [J Combin Theory Ser B 81(1) (2001), 100–109] provided a sharp δ(__G__) condition such that for any set __X__ of __t__ vertices, __G__ contains a hamiltonian cycle __H__ so that the dis

A Remark on Hamiltonian Cycles

✍ Vu-Dinh-Hoa 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 309 KB

## Abstract Let __G__ be an undirected and simple graph on __n__ vertices. Let ω, α and χ denote the number of components, the independence number and the connectivity number of __G. G__ is called a 1‐tough graph if ω(__G__ – __S__) ⩽ |__S__| for any subset __S__ of __V__(__G__) such that ω(__G__ −

The construction of optimal Hamiltonian

The construction of optimal Hamiltonian cycles in multivertex graphs

✍ Zh. N. Zaitseva; M. E. Shtein 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 294 KB