✦ LIBER ✦

Multicluster interleaving on paths and cycles

✍ Scribed by Jiang, A.; Bruck, J.

Book ID: 114638631
Publisher: IEEE
Year: 2005
Tongue: English
Weight: 477 KB
Volume: 51
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2004.840893

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Hamiltonian cycles and Hamiltonian pa

On Hamiltonian cycles and Hamiltonian paths

✍ M. Sohel Rahman; M. Kaykobad 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 89 KB

On cycles and paths in digraphs

✍ M.C. Heydemann 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 273 KB

The purpose of this communication is to announce some slrfficient conditions on degrees and number of arcs to insure the existence of cycles and paths in directed graphs. We show that these results are the best possible. The proofs of the theorems can be found in [4].

Closures, cycles, and paths

✍ Jochen Harant; Arnfried Kemnitz; Akira Saito; Ingo Schiermeyer 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB

## Abstract In 1960 Ore proved the following theorem: Let __G__ be a graph of order __n__. If __d__(__u__) + __d__(__v__)≥__n__ for every pair of nonadjacent vertices __u__ and __v__, then __G__ is hamiltonian. Since then for several other graph properties similar sufficient degree conditions have

Tightening Nonsimple Paths and Cycles on

Tightening Nonsimple Paths and Cycles on Surfaces

✍ de Verdière, Éric Colin; Erickson, Jeff 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 453 KB

Paths and cycles of hypergraphs

✍ Jianfang Wang; Tony T. Lee 📂 Article 📅 1999 🏛 SP Science China Press 🌐 English ⚖ 638 KB

On relative length of longest paths and

On relative length of longest paths and cycles

✍ Kenta Ozeki; Masao Tsugaki; Tomoki Yamashita 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract For a graph __G__, __p__(__G__) and __c__(__G__) denote the order of a longest path and a longest cycle of __G__, respectively. In this paper, we prove that if __G__ is a 3 ‐connected graph of order __n__ such that the minimum degree sum of four independent vertices is at least __n__+ 6