𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Pancyclic properties of the graph of some 0–1 polyhedra

✍ Scribed by Denis Naddef

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
878 KB
Volume
37
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The square of a connected S(K1,3)-free g
The square of a connected S(K1,3)-free graph is vertex pancyclic
✍ George Hendry; Walter Vogler 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

We prove the conjecture of Gould and Jacobson that a connected S(K1,J free graph has a vertex pancyclic square. Since .S(K1,J is not vertex pancyclic, this result is best possible. ## Our notation generally follows that used in [l] . A graph G is Hamilroniun if it contains a cycle through all its