✦ LIBER ✦

Covering Graphs by Cycles

✍ Scribed by Fan, Genghua

Book ID: 118198459
Publisher: Society for Industrial and Applied Mathematics
Year: 1992
Tongue: English
Weight: 687 KB
Volume: 5
Category: Article
ISSN: 0895-4801
DOI: 10.1137/0405039

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On covering expander graphs by Hamilton

On covering expander graphs by Hamilton cycles

✍ Roman Glebov; Michael Krivelevich; Tibor Szabó 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB

Covering vertices by cycles

✍ Mekkia Kouider 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 900 KB

## Abstract “If G is a 2‐connected graph with n vertices and minimum degree d, then the vertices of G can be covered by less than n/d cycles. This settles a conjecture of Enomoto, Kaneko and Tuza for 2‐connected graphs.”

Cycle covering in bridgeless graphs

✍ Pierre Fraisse 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 411 KB

Minimum cycle covers of graphs

✍ Fan, Genghua 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 1 views

Some new results on minimum cycle covers are proved. As a consequence, it is obtained that the edges of a bridgeless graph G can be covered by cycles of total length at most |E(G)| + 25 24 (|V (G)| -1), and at most |E(G)| + |V (G)| -1 if G contains no circuit of length 8 or 12.

Covering a graph with cycles

✍ Hong Wang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 444 KB

## Abstract Let __k__ and __n__ be two integers such that __k__ ≥ 0 and __n__ ≥ 3(__k__ + 1). Let __G__ be a graph of order __n__ with minimum degree at least ⌈(__n__ + __k__)/2⌉. Then __G__ contains __k__ + 1 independent cycles covering all the vertices of __G__ such that __k__ of them are triangl

Cycles in Graphs and Covers

✍ Dreher, Deanna 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 426 KB