✦ LIBER ✦

Locally Hamiltonian graphs

✍ Scribed by D. Katona; A. Kostochka; Ya. Pykh; B. Stechkin

Book ID: 105099248
Publisher: SP MAIK Nauka/Interperiodica
Year: 1989
Tongue: English
Weight: 282 KB
Volume: 45
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01158712

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian N2-locally connected claw-fr

Hamiltonian N2-locally connected claw-free graphs

✍ Hong-Jian Lai; Yehong Shao; Mingquan Zhan 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 63 KB 👁 1 views

A graph G is N 2 -locally connected if for every vertex v in G, the edges not incident with v but having at least one end adjacent to v in G induce a connected graph. In 1990, Ryja ´c ˇek conjectured that every 3-connected N 2 -locally connected claw-free graph is Hamiltonian. This conjecture is pro

A note on locally connected and hamilton

A note on locally connected and hamiltonian-connected graphs

✍ Gary Chartrand; Ronald J. Gould; Albert D. Polimeni 📂 Article 📅 1979 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 180 KB

Hamiltonian circuits in N2-locally conne

Hamiltonian circuits in N2-locally connected K1,3-free graphs

✍ ZdeněK Ryjáček 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 407 KB 👁 1 views

## Abstract There are many results concerned with the hamiltonicity of __K__~1,3~‐free graphs. In the paper we show that one of the sufficient conditions for the __K__~1,3~‐free graph to be Hamiltonian can be improved using the concept of second‐type vertex neighborhood. The paper is concluded with

Hamiltonian properties of locally connec

Hamiltonian properties of locally connected graphs with bounded vertex degree

✍ Valery S. Gordon; Yury L. Orlovich; Chris N. Potts; Vitaly A. Strusevich 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 442 KB

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