✦ LIBER ✦

Longest Cycles in 3-connected Graphs with Given Independence Number

✍ Scribed by Y. Manoussakis

Book ID: 106047788
Publisher: Springer Japan
Year: 2009
Tongue: English
Weight: 113 KB
Volume: 25
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-009-0846-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Longest cycles in k-connected graphs wit

Longest cycles in k-connected graphs with given independence number

✍ Suil O; Douglas B. West; Hehui Wu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Longest cycles in 3-connected graphs

✍ B. Wei 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Longest cycles in 3-connected cubic grap

Longest cycles in 3-connected cubic graphs

✍ Bill Jackson 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 549 KB

Longest cycles in 3-connected graphs con

Longest cycles in 3-connected graphs contain three contractible edges

✍ Nathaniel Dean; Robert L. Hemminger; Katsuhiro Ota 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB 👁 1 views

We show that if G is a 3-connected graph of order at least seven, then every longest path between distinct vertices in G contains at least two contractible edges. An immediate corollary is that longest cycles in such graphs contain at least three contractible edges. We consider only finite undirect

Large minors in graphs with given indepe

Large minors in graphs with given independence number

✍ József Balogh; A.V. Kostochka 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 303 KB

A degree sum condition for longest cycle

A degree sum condition for longest cycles in 3-connected graphs

✍ Tomoki Yamashita 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB 👁 1 views

## Abstract For a graph __G__, we denote by __d__~__G__~(__x__) and κ(__G__) the degree of a vertex __x__ in __G__ and the connectivity of __G__, respectively. In this article, we show that if __G__ is a 3‐connected graph of order __n__ such that __d__~__G__~(__x__) + __d__~__G__~(__y__) + __d__~__