𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs

✍ Scribed by Alexandru I. Tomescu

Book ID
113567664
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
195 KB
Volume
312
Category
Article
ISSN
0012-365X

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

Critical graphs for subpancyclicity of 3
Critical graphs for subpancyclicity of 3-connected claw-free graphs
✍ Ronald J. Gould; Tomasz Łuczak; Florian Pfender πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 173 KB

## Abstract Let ${\cal{F}}\_{k}$ be the family of graphs __G__ such that all sufficiently large __k__ ‐connected claw‐free graphs which contain no induced copies of __G__ are subpancyclic. We show that for every __k__β‰₯3 the family ${\cal{F}}\_{1}k$ is infinite and make the first step toward the c