✦ LIBER ✦

Paths and cycles in matroid base graphs

✍ Scribed by Brian Alspach; Guizhen Liu

Publisher: Springer Japan
Year: 1989
Tongue: English
Weight: 318 KB
Volume: 5
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01788672

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

✍ 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

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

Cycles in Circuit Graphs of Matroids

✍ Ping Li; Guizhen Liu 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 212 KB

Parity theorems for paths and cycles in

Parity theorems for paths and cycles in graphs

✍ J. A. Bondy; F. Y. Halberstam 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 1 views

We extend an elegant proof technique of A . G . Thomason, and deduce several parity theorems for paths and cycles in graphs. For example, a graph in which each vertex is of even degree has an even number of paths if and only if it is of even order, and a graph in which each vertex is of odd degree h