✦ LIBER ✦

Non-separating even cycles in highly connected graphs

✍ Scribed by Shinya Fujita; Ken-ichi Kawarabayashi

Book ID: 106167763
Publisher: Springer-Verlag
Year: 2010
Tongue: English
Weight: 255 KB
Volume: 30
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-010-2482-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-Separating Paths in 4-Connected Grap

Non-Separating Paths in 4-Connected Graphs

✍ Ken-ichi Kawarabayashi; Orlando Lee; Xingxing Yu 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 193 KB

Hamilton cycles in highly connected and

Hamilton cycles in highly connected and expanding graphs

✍ Dan Hefetz; Michael Krivelevich; Tibor Szabó 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 584 KB

Even cycles in graphs

✍ Joseph G. Conlon 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 888 KB

## Abstract Let __G__ be a 3‐connected simple graph of minimum degree 4 on at least six vertices. The author proves the existence of an even cycle __C__ in __G__ such that __G‐V__(__C__) is connected and __G‐E__(__C__) is 2‐connected. The result is related to previous results of Jackson, and Thomas

On 4-connected graphs without even cycle

On 4-connected graphs without even cycle decompositions

✍ Romeo Rizzi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 90 KB

Even Cycles in Graphs with Many Odd Cycl

Even Cycles in Graphs with Many Odd Cycles

✍ Ralph J. Faudree; Evelyne Flandrin; Michael S. Jacobson; Jenő Lehel; Richard H. 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 133 KB

Cycles of even length in graphs

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