𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonian paths in vertex-symmetric graphs of order 5p

✍ Scribed by Dragan Marušič; T.D. Parsons

Book ID
107748426
Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
673 KB
Volume
42
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian paths in vertex-symmetric gr
Hamiltonian paths in vertex-symmetric graphs of order 4p
✍ Dragan Marušič; T.D. Parsons 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 562 KB

It is shown that every connected vertex-symmetric graph of order 4p (p a prime) has a Hamiltonian path. ## 1. Il#aoductjon L. Lovasz has conjectured that every connected vertex-symmetric graph (cvsg) has a Hamiltonian path. This conjecture has been verified for graphs of order p, 2p, 3p, p2, and p

Hamiltonian cycles and paths in vertex-t
Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups
✍ Marc J. Lipman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 378 KB

In 1968, L. Lovfisz conjectured that every connected, vertex-transitive graph had a Hamiltonian path. In this paper the following results are proved: (1) If a connected graph has a transitive nilpotent group acting on it, then the graph has a Hamiltonian path; (2) a connected, vertex-transitive grap

Powers of Hamiltonian paths in interval
Powers of Hamiltonian paths in interval graphs
✍ Isaak, Garth 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 232 KB 👁 3 views

We give a simple proof that the obvious necessary conditions for a graph to contain the k th power of a Hamiltonian path are sufficient for the class of interval graphs. The proof is based on showing that a greedy algorithm tests for the existence of Hamiltonian path powers in interval graphs. We wi