✦ LIBER ✦

Hamiltonian pancyclic graphs

✍ Scribed by Denise Amar; Evelyne Flandrin; Irène Fournier; Anne Germa

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 79 KB
Volume: 46
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90130-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pancyclism and Bipancyclism of Hamiltoni

Pancyclism and Bipancyclism of Hamiltonian Graphs

✍ S.M. Zhang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 328 KB

On the girth of hamiltonian weakly pancy

On the girth of hamiltonian weakly pancyclic graphs

✍ Bollob�s, B�la; Thomason, Andrew 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 2 views

A graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circumference. In answer to a question of Erdős, we show that a Hamiltonian weakly-pancyclic graph of order n can have girth as large as about 2 n/ log n. In contrast to this, we show that the existence of

Pancyclic oriented graphs

✍ Zeng Min Song 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 324 KB

## Abstract Let __D__ be an oriented graph of order __n__ ≧ 9 and minimum degree __n__ − 2. This paper proves that __D__ is pancyclic if for any two vertices __u__ and __v__, either __uv__ ≅ __A(D)__, or __d__~__D__~^+^(__u__) + __d__~__D__~^−^(__v__) ≧ __n__ − 3.

Weakly pancyclic graphs

✍ Brandt, Stephan; Faudree, Ralph; Goddard, Wayne 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 517 KB

In generalizing the concept of a pancyclic graph, we say that a graph is ''weakly pancyclic'' if it contains cycles of every length between the length of a shortest and a longest cycle. In this paper it is shown that in many cases the requirements on a graph which ensure that it is weakly pancyclic

Locally Pancyclic Graphs

✍ Ladislav Stacho 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 215 KB

We prove the following theorem. Let G be a graph of order n and let W V(G). If |W | 3 and d G (x)+d G ( y) n for every pair of non-adjacent vertices x, y # W, then either G contains cycles C 3 ,

Weakly Pancyclic Graphs

✍ Béla Bollobás; Andrew Thomason 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 145 KB

A graph is called weakly pancyclic if it contains cycles of all lengths between its girth and circumference. A substantial result of Ha ggkvist, Faudree, and Schelp (1981) states that a Hamiltonian non-bipartite graph of order n and size at least w(n&1) 2 Â4x+2 contains cycles of every length l, 3 l