𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on pancyclism of highly connected graphs

✍ Scribed by Evelyne Flandrin; Hao Li; Antoni Marczyk; Mariusz Woźniak

Book ID
108113404
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
199 KB
Volume
286
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

A Note onk-Connected Rayless Graphs
A Note onk-Connected Rayless Graphs
✍ Rudolf Halin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 160 KB

In this note a short new proof of Diestel's characterization theorem for infinite k-connected rayless graphs is given, using the concept of the order of a rayless graph which was introduced by R. Schmidt. 1998 Academic Press Diestel [3, Theorem 4.3] gives a beautiful description of the structure of