✦ LIBER ✦

A theorem on pancyclic-oriented graphs

✍ Scribed by Maria Overbeck-Larisch

Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 275 KB
Volume: 23
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(77)90028-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

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

Some theorems of uniquely pancyclic grap

Some theorems of uniquely pancyclic graphs

✍ Yongbing Shi 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 773 KB

On circuits and pancyclic line graphs

✍ A. Benhocine; L. Clark; N. Köhler; H. J. Veldman 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 649 KB

Clark proved that L(G) is hamiltonian if G is a connected graph of order n 2 6 such that deg u + deg v 2 n -1p(n) for every edge uv of G, where p(n) = 0 if n is even and p(n) = 1 if n is odd. Here it is shown that the bound n -1 -dn) can be decreased to (2n + 1)/3 if every bridge of G is incident wi

An Orientation Theorem for Graphs

✍ A.M.H. Gerards 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 519 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