𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on the minimum size of a vertex pancyclic graph

✍ Scribed by H.J. Broersma

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
152 KB
Volume
164
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A note on vertex pancyclic oriented grap
A note on vertex pancyclic oriented graphs
✍ Bang-Jensen, JοΏ½rgen; Guo, Yubao πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 185 KB πŸ‘ 2 views

Let D be an oriented graph of order n β‰₯ 9, minimum degree at least n -2, such that, for the choice of distinct vertices x and y, . Graph Theory 18 (1994), 461-468) proved that D is pancyclic. In this note, we give a short proof, based on Song's result, that D is, in fact, vertex pancyclic. This also

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