✦ LIBER ✦

Nesting directed cycle systems of even length

✍ Scribed by C.A. Rodger; D.R. Stinson

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 468 KB
Volume: 13
Category: Article
ISSN: 0195-6698
DOI: 10.1016/0195-6698(92)90026-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nesting of cycle systems of odd length

✍ C.C. Lindner; C.A. Rodger; D.R. Stinson 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 780 KB

m edges {x1, x2}, {x2, x3}, . . . , {x,,,\_~, x,}, {x,, xl} such that the vertices x1

Cycles of even lengths modulo k

✍ Ajit A. Diwan 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

## Abstract Thomassen [J Graph Theory 7 (1983), 261–271] conjectured that for all positive integers __k__ and __m__, every graph of minimum degree at least __k__+1 contains a cycle of length congruent to 2__m__ modulo __k__. We prove that this is true for __k__⩾2 if the minimum degree is at least 2

Cycles of even length in graphs

✍ J.A Bondy; M Simonovits 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 363 KB

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

Cyclic even cycle systems of the complet

Cyclic even cycle systems of the complete graph

✍ Shung-Liang Wu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB 👁 1 views

## Abstract In this article, it is proved that for each even integer __m__⩾4 and each admissible value __n__ with __n__>2__m__, there exists a cyclic __m__‐cycle system of __K__~__n__~, which almost resolves the existence problem for cyclic __m__‐cycle systems of __K__~__n__~ with __m__ even. © 201

Bounds of the longest directed cycle len

Bounds of the longest directed cycle length for minimal strong digraphs

✍ Zhi-bo Chen; Fu-ji Zhang 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 532 KB

In this paper we present the upper and lower bounds of the longest directed cycle length for minimal strr,ng digraphs in terms of the numbers of vertices and arcs. These bounds are both sharp. In addition, we give analogous results for minimal 2-edge connected graphs.