𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Path partition number in tough graphs

✍ Scribed by Hoa Vu Dinh

Book ID
104113655
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
175 KB
Volume
164
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Disjoint T-paths in tough graphs
Disjoint T-paths in tough graphs
✍ TomΓ‘Ε‘ Kaiser πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 120 KB

## Abstract Let __G__ be a graph and __T__ a set of vertices. A __T‐path__ in __G__ is a path that begins and ends in __T__, and none of its internal vertices are contained in __T__. We define a __T‐path covering__ to be a union of vertex‐disjoint __T__‐paths spanning all of __T__. Concentrating on

Long paths and cycles in tough graphs
Long paths and cycles in tough graphs
✍ H. J. Broersma; J. van den Heuvel; H. A. Jung; H. J. Veldman πŸ“‚ Article πŸ“… 1993 πŸ› Springer Japan 🌐 English βš– 575 KB
On the k-path partition of graphs
On the k-path partition of graphs
✍ George Steiner πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 150 KB