𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Embedding cycles of given length in oriented graphs

✍ Scribed by Daniela Kühn; Deryk Osthus; Diana Piguet

Book ID
119233275
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
246 KB
Volume
34
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycles of given length in some K1,3-free
Cycles of given length in some K1,3-free graphs
✍ Cun-Quan Zhang 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 478 KB

Let G be a non-trivial connected &,-free graph. If any vertex cut of G contains a veitex v such that G@!(u)) is connected, we prove that G is pancyclic. If G(Z+I(u)) is conaected for any vertex u of G, we prove that G is vertex pancyclic and obtain a polynomial time algorithm for constructing cycles

Embedding cycles in IEH graphs
Embedding cycles in IEH graphs
✍ Hung-Yi Chang; Rong-Jaye Chen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 400 KB

We embed cycles into IEH graphs. First, IEH graphs are proved to be Hamiltonian except when they are of size 2" -1 for all n > 2. Next, we show that for an IEH graph of size N, an arbitrary cycle of even length N, where 3 < Ne < N is found. We also find an arbitrary cycle of odd length NO where 2 <