𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Matchings of cycles and paths in directed graphs

✍ Scribed by Gyula Pap; László Szegő

Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
207 KB
Volume
27
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

PATHS AND CYCLES IN COLORED GRAPHS
PATHS AND CYCLES IN COLORED GRAPHS
✍ Xueliang LI; Shenggui Zhang; Hajo Broersma 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 186 KB
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

Hamilton cycles and paths in butterfly g
Hamilton cycles and paths in butterfly graphs
✍ Stephen A. Wong 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 536 KB

## Abstract A cycle __C__ in a graph __G__ is a __Hamilton cycle__ if __C__ contains every vertex of __G__. Similarly, a path __P__ in __G__ is a __Hamilton path__ if __P__ contains every vertex of __G__. We say that __G__ is __Hamilton__‐__connected__ if for any pair of vertices, __u__ and __v__ o