✦ LIBER ✦

Packing Cycles in Graphs

✍ Scribed by Guoli Ding; Wenan Zang

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 267 KB
Volume: 86
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.2002.2134

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing complete multipartite graphs wit

Packing complete multipartite graphs with 4-cycles

✍ Elizabeth J. Billington; Hung-Lin Fu; C.A. Rodger 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 394 KB 👁 1 views

Cycles in butterfly graphs

✍ Hwang, Shien-Ching; Chen, Gen-Huey 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB 👁 3 views

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

Packing cuts in undirected graphs

✍ Alberto Caprara; Alessandro Panconesi; Romeo Rizzi 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

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 👁 3 views

Edge disjoint cycles in graphs

✍ Li Hao 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 419 KB