✦ LIBER ✦

Pancyclic graphs II

✍ Scribed by J.A Bondy; A.W Ingleton

Book ID: 103502595
Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 293 KB
Volume: 20
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(76)90064-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pancyclic graphs I

✍ J.A Bondy 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 216 KB

Vertex Pancyclic Graphs

✍ Bert Randerath; Lutz Volkmann; Ingo Schiermeyer; Meike Tewes 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 93 KB

Hamiltonian pancyclic graphs

✍ Denise Amar; Evelyne Flandrin; Irène Fournier; Anne Germa 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 79 KB

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 ,