✦ LIBER ✦

Cycle contraction in oriented graphs

✍ Scribed by P. V. Nalivaiko

Book ID: 111494972
Publisher: Allerton Press Inc
Year: 2010
Tongue: English
Weight: 910 KB
Volume: 65
Category: Article
ISSN: 0027-1322
DOI: 10.3103/s0027132210030058

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycles in strong oriented graphs

✍ M.C. Heydemann 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 612 KB

ON α,β CYCLE-CONTRACTIBLE GRAPHS

✍ Winter, P. A. 📂 Article 📅 1988 🏛 Taylor and Francis Group 🌐 English ⚖ 209 KB

Cycles of given length in oriented graph

Cycles of given length in oriented graphs

✍ Luke Kelly; Daniela Kühn; Deryk Osthus 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 248 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

Contractible cycles in graphs with large

Contractible cycles in graphs with large minimum degree

✍ Yoshimi Egawa 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 717 KB

Contractible edges in longest cycles in

Contractible edges in longest cycles in non-Hamiltonian graphs

✍ M.N. Ellingham; R.L. Hemminger; Kathryn E. Johnson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 727 KB

An edge of a 3-connected graph is contractible if its contraction results in a graph which is still 3-connected. All 3-connected graphs with seven or more vertices are known to have at least three contractible edges on any longest cycle. Recently, it has been conjectured that any non-Hamiltonian 3-c