𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Long paths and cycles in tough graphs

✍ Scribed by H. J. Broersma; J. van den Heuvel; H. A. Jung; H. J. Veldman

Publisher
Springer Japan
Year
1993
Tongue
English
Weight
575 KB
Volume
9
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Long paths and cycles in oriented graphs
Long paths and cycles in oriented graphs
✍ Bill Jackson πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 501 KB

## Abstract We obtain several sufficient conditions on the degrees of an oriented graph for the existence of long paths and cycles. As corollaries of our results we deduce that a regular tournament contains an edge‐disjoint Hamilton cycle and path, and that a regular bipartite tournament is hamilto

Longest cycles in tough graphs
Longest cycles in tough graphs
✍ Jung, H.A.; Wittmann, P. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 347 KB πŸ‘ 2 views

In this article, we establish bounds for the length of a longest cycle C in a 2-connected graph G in terms of the minimum degree Ξ΄ and the toughness t. It is shown that C is a Hamiltonian cycle or |C| β‰₯ (t + 1)Ξ΄ + t.

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