✦ LIBER ✦

Cycles in butterfly graphs

✍ Scribed by Hwang, Shien-Ching; Chen, Gen-Huey

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 214 KB
Volume: 35
Category: Article
ISSN: 0028-3045
DOI: 10.1002/(sici)1097-0037(200003)35:2<161::aid-net7>3.0.co;2-q

No coin nor oath required. For personal study only.

✦ Synopsis

Three problems in connection with cycles on the butterfly graphs are studied in this paper. The first problem is to construct complete uniform cycle partitions for the butterfly graphs. Suppose that

📜 SIMILAR VOLUMES

Longest cycles in tough graphs

✍ Jung, H.A.; Wittmann, P. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 347 KB 👁 2 views

In this article, we establish bounds for the length of a longest cycle C in a 2-connected graph G in terms of the minimum degree δ and the toughness t. It is shown that C is a Hamiltonian cycle or |C| ≥ (t + 1)δ + t.

Long cycles in critical graphs

✍ Noga Alon; Michael Krivelevich; Paul Seymour 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 57 KB 👁 1 views

Hamilton cycles in random graphs and dir

Hamilton cycles in random graphs and directed graphs

✍ Colin Cooper; Alan Frieze 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB 👁 2 views

Disjoint cycles in star-free graphs

✍ Markus, Lisa R.; Snevily, Hunter S. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 322 KB 👁 1 views

A graph is claw-free if it does not contain K l , 3 as an induced subgraph. It is Kl,,-free if it does not contain K l , r as an induced subgraph. We show that if a graph is Kl,,-free ( r 2 4), only p + 2r -1 edges are needed to insure that G has t w o disjoint cycles. As an easy consequence w e ge

Edge disjoint Hamilton cycles in graphs

✍ Guojun Li 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

Short odd cycles in 4-chromatic graphs

✍ Nilli, A. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB 👁 1 views

It is shown that any 4-chromatic graph on n vertices contains an odd cycle of length smaller than √ 8n.