✦ LIBER ✦

A lower bound for the shortest Hamiltonean path in directed graphs

✍ Scribed by N. Maculan; J. J. C. Salles

Publisher: Springer
Year: 1991
Tongue: German
Weight: 251 KB
Volume: 13
Category: Article
ISSN: 0171-6468
DOI: 10.1007/bf01719934

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lower Bound for the Shortest Path Prob

A Lower Bound for the Shortest Path Problem

✍ Ketan Mulmuley; Pradyut Shah 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 183 KB

A lower bound on the average shortest pa

A lower bound on the average shortest path length in regular graphs

✍ V. G. Cerf; D. D. Cowan; R. C. Mullin; R. G. Stanton 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB

A lower bound for the steiner tree probl

A lower bound for the steiner tree problem in directed graphs

✍ Weiguo Liu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 593 KB

A lower bound for the connectivity of di

A lower bound for the connectivity of directed Euler tour transformation graphs

✍ Xueliang Li 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 327 KB

Lower bounds for sense of direction in r

Lower bounds for sense of direction in regular graphs

✍ Paolo Boldi; Sebastiano Vigna 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 237 KB

A lower bound for groupies in graphs

✍ Mackey, John 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 2 views

A non-isolated vertex of a graph G is called a groupie if the average degree of the vertices connected to it is larger than or equal to the average degree of the vertices in G. An isolated vertex is a groupie only if all vertices of G are isolated. While it is well known that every graph must contai