𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Collective Tree Spanners in Graphs with Bounded Parameters

✍ Scribed by Feodor F. Dragan; Chenyu Yan

Publisher
Springer
Year
2008
Tongue
English
Weight
579 KB
Volume
57
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimal tree 3-spanners in directed path
Optimal tree 3-spanners in directed path graphs
✍ Le, HoοΏ½ng-Oanh; Le, Van Bang πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 122 KB πŸ‘ 2 views

In a graph G, a spanning tree T is called a tree t-spanner of G if the distance between any two vertices in T is at most t times their distance in G. While the complexity of finding a tree t-spanner of a given graph is known for any fixed t 3, the case t Ο­ 3 still remains open. In this article, we s

Ka,k Minors in Graphs of Bounded Tree-Wi
Ka,k Minors in Graphs of Bounded Tree-Width
✍ Thomas BΓΆhme; John Maharry; Bojan Mohar πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 175 KB

It is shown that for any positive integers k and w there exists a constant N ¼ N ðk; wÞ such that every 7-connected graph of tree-width less than w and of order at least N contains K 3;k as a minor. Similar result is proved for K a;k minors where a is an arbitrary fixed integer and the required conn