✦ LIBER ✦

Finding and counting given length cycles

✍ Scribed by N. Alon; R. Yuster; U. Zwick

Book ID: 110547415
Publisher: Springer
Year: 1997
Tongue: English
Weight: 684 KB
Volume: 17
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf02523189

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

FactoringN-Cycles and Counting Maps of G

FactoringN-Cycles and Counting Maps of Given Genus

✍ A. Goupil; Gilles Schaeffer 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 265 KB

We present an explicit expression for the number of decompositions of an n-cycle as a product of any two permutations of cycle types given by partitions λ and µ. The same expression is also counting the number of unicellular rooted bicolored maps on an orientable surface of genus g with vertex degre

Almost Given Length Cycles in Digraphs

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

Finding Paths and Cycles of Superpolylog

Finding Paths and Cycles of Superpolylogarithmic Length

✍ Gabow, Harold N. 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 288 KB

Cycles of given length in oriented graph

Cycles of given length in oriented graphs

✍ Luke Kelly; Daniela Kühn; Deryk Osthus 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 248 KB

Embedding cycles of given length in orie

Embedding cycles of given length in oriented graphs

✍ Daniela Kühn; Deryk Osthus; Diana Piguet 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 246 KB

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