✦ LIBER ✦

Highly linked graphs

✍ Scribed by Béla Bollobás; Andrew Thomason

Book ID: 105138371
Publisher: Springer-Verlag
Year: 1996
Tongue: English
Weight: 440 KB
Volume: 16
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01261316

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Highly parity linked graphs

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

OnH-Linked Graphs

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

2-Linked Graphs

✍ Thomassen, Carsten 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 687 KB

Graph-links

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

Pan-H-Linked Graphs

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

Highly irregular graphs

✍ Yousef Alavi; Gary Chartrand; F. R. K. Chung; Paul Erdös; R. L. Graham; Ortrud R 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 531 KB

A connected graph is highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper w e investigate several problems concerning the existence and enumeration of highly irregular graphs as well as their independence numbers, with particular focus on the cor