𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On tree 3-spanners in directed path graphs

✍ Scribed by B.S. Panda; Anita Das

Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
159 KB
Volume
50
Category
Article
ISSN
0028-3045

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

The degree-preserving spanning tree prob
The degree-preserving spanning tree problem in strongly chordal and directed path graphs
✍ Ching-Chi Lin; Gerard J. Chang; Gen-Huey Chen πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 108 KB

## Abstract Suppose __G__ is a connected graph and __T__ a spanning tree of __G__. A vertex __v__ Ξ΅ __V__(__G__) is said to be a degree‐preserving vertex if its degree in __T__ is the same as its degree in __G__. The degree‐preserving spanning tree problem is to find a spanning tree __T__ of a conn

On packing 3-vertex paths in a graph
On packing 3-vertex paths in a graph
✍ Atsushi Kaneko; Alexander Kelmans; Tsuyoshi Nishimura πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 276 KB πŸ‘ 2 views
On paths in planar graphs
On paths in planar graphs
✍ Sanders, Daniel P. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 93 KB πŸ‘ 2 views

This paper generalizes a theorem of Thomassen on paths in planar graphs. As a corollary, it is shown that every 4-connected planar graph has a Hamilton path between any two specified vertices x, y and containing any specified edge other than xy.