𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The square of every two-connected graph is Hamiltonian

✍ Scribed by Herbert Fleischner

Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
318 KB
Volume
16
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Every connected, locally connected nontr
Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
✍ David J. Oberly; Slobodan K. SimiΔ‡; David P. Sumner πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 232 KB

## Abstract A graph is locally connected if every neighborthood induces a connected subgraph. We show here that every connected, locally connected graph on __p__ β‰₯ 3 vertices and having no induced __K__~1,3~ is Hamiltonian. Several sufficient conditions for a line graph to be Hamiltonian are obtain

Every 3-connected claw-free Z8-free grap
Every 3-connected claw-free Z8-free graph is Hamiltonian
✍ Hong-Jian Lai; Liming Xiong; Huiya Yan; Jin Yan πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 115 KB πŸ‘ 2 views

## Abstract In this article, we first show that every 3‐edge‐connected graph with circumference at most 8 is supereulerian, which is then applied to show that a 3‐connected claw‐free graph without __Z__~8~ as an induced subgraph is Hamiltonian, where __Z__~8~ denotes the graph derived from identify

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