✦ LIBER ✦

2-Linked Graphs

✍ Scribed by Thomassen, Carsten

Book ID: 122648003
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 687 KB
Volume: 1
Category: Article
ISSN: 0195-6698
DOI: 10.1016/S0195-6698(80)80039-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

OnH-Linked Graphs

✍ Michael Ferrara; Ronald Gould; Gerard Tansey; Thor Whalen 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 109 KB

Highly linked graphs

✍ Béla Bollobás; Andrew Thomason 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 440 KB

Graph-links

✍ D. P. Il’yutko; V. O. Manturov 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 186 KB

Highly parity linked graphs

✍ Ken-Ichi Kawarabayashi; Bruce Reed 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 421 KB

Pan-H-Linked Graphs

✍ Michael Ferrara; Colton Magnant; Jeffrey Powell 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 282 KB

K-linked graphs with girth condition

✍ Ken-ichi Kawarabayashi 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 55 KB

## Abstract Recently, Mader [7] proved that every 2__k__‐connected graph with girth __g__(__G__) sufficiently large is __k__‐linked. We show here that __g__(__G__ ≥ 11 will do unless __k__ = 4,5. If __k__ = 4,5, then __g__(__G__) ≥ 19 will do. © 2003 Wiley Periodicals, Inc. J Graph Theory 45: 48–50