✦ LIBER ✦

Pancyclic oriented graphs

✍ Scribed by Zeng Min Song

Publisher: John Wiley and Sons
Year: 1994
Tongue: English
Weight: 324 KB
Volume: 18
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190180504

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 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

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

Pancyclic subgraphs of random graphs

✍ Choongbum Lee; Wojciech Samotij 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

## Abstract An __n__‐vertex graph is called pancyclic if it contains a cycle of length __t__ for all 3≤__t__≤__n__. In this article, we study pancyclicity of random graphs in the context of resilience, and prove that if __p__>__n__^−1/2^, then the random graph __G__(__n, p__) a.a.s. satisfies the f

Pancyclicity of connected circulant grap

Pancyclicity of connected circulant graphs

✍ Bogdanowicz, Z. R. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB 👁 1 views

The circulant G,(al,. . . , ak), where 0 < al < ... < a k < ( n + 1 ) / 2 , is defined as the vertex-transitive graph that has vertices ifal,. . . ,if a k (mod n) adjacent to each vertex i. In this work we show that the connected circulants of degree at least three contain all even cycles. In additi