✦ LIBER ✦

Cycles of given length in oriented graphs

✍ Scribed by Luke Kelly; Daniela Kühn; Deryk Osthus

Book ID: 108167474
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 248 KB
Volume: 100
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2009.08.002

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

Cycles in strong oriented graphs

✍ M.C. Heydemann 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 612 KB

Almost Given Length Cycles in Digraphs

✍ Raphael Yuster 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 92 KB

Cycles of even length in graphs

✍ J.A Bondy; M Simonovits 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 363 KB

List coloring of graphs having cycles of

List coloring of graphs having cycles of length divisible by a given number

✍ S. Akbari; M. Ghanbari; S. Jahanbekam; M. Jamaali 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 237 KB

The number of cycle lengths in graphs of

The number of cycle lengths in graphs of given minimum degree and girth

✍ P. Erdős; R.J. Faudree; C.C. Rousseau; R.H. Schelp 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 333 KB

This paper determines lower bounds on the number of different cycle lengths in a graph of given minimum degree k and girth g. The most general result gives a lower bound of ck ~.