✦ LIBER ✦

Complementary Cycles of All Lengths in Tournaments

✍ Scribed by Z.M. Song

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 295 KB
Volume: 57
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bipartite graphs with cycles of all even

Bipartite graphs with cycles of all even lengths

✍ Edward Schmeichel; John Mitchem 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB 👁 1 views

## Abstract Let __G__ = (__X, Y, E__) be a bipartite graph with __X__ = __Y__ = __n__. Chvátal gave a condition on the vertex degrees of __X__ and __Y__ which implies that __G__ contains a Hamiltonian cycle. It is proved here that this condition also implies that __G__ contains cycles of every even

Lengths of cycles in halin graphs

✍ J. A. Bondy; L. Lovász 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB 👁 1 views

A Halin graph is a plane graph H = T U C, where T is a plane tree with no vertex of degree t w o and at least one vertex of degree three or more, and C is a cycle connecting the endvertices of T in the cyclic order determined by the embedding of T We prove that such a graph on n vertices contains cy

Periods in missing lengths of rainbow cy

Periods in missing lengths of rainbow cycles

✍ Petr Vojtěchovský 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

## Abstract A cycle in an edge‐colored graph is said to be rainbow if no two of its edges have the same color. For a complete, infinite, edge‐colored graph __G__, define Then 𝔊(__G__) is a monoid with respect to the operation __n__∘__m__=__n__+ __m__−2, and thus there is a least positive integer π

On the existence of specified cycles in

On the existence of specified cycles in a tournament

✍ Abdelhamid Benhocine; A. Pawel Wojda 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB 👁 1 views

For 2 s p s n and n 2 3, D(n, p) denotes the digraph with n vertices obtained from a directed cycle of length n by changing the orientation of p -1 consecutives edges. In this paper, we prove that every tournament of order n 2 7 contains D(n, p ) for p = 2, 3, ..., n. Furthermore, we determine the t

Distribution of Cycle Lengths in Graphs

✍ Genghua Fan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Bondy and Vince proved that every graph with minimum degree at least three contains two cycles whose lengths differ by one or two, which answers a question raised by Erdo ˝s. By a different approach, we show in this paper that if G is a graph with minimum degree d(G) \ 3k for any positive integer k,

Solution of a conjecture of Tewes and Vo

Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments

✍ Dirk Meierling 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB 👁 1 views

## Abstract A directed cycle __C__ of a digraph __D__ is extendable if there exists a directed cycle __C__′ in __D__ that contains all vertices of __C__ and an additional one. In 1989, Hendry defined a digraph __D__ to be cycle extendable if it contains a directed cycle and every non‐Hamiltonian di