✦ LIBER ✦

Cycle covers of cubic multigraphs

✍ Scribed by Brian Alspach; Cun-Quan Zhang

Book ID: 103056297
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 446 KB
Volume: 111
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90135-g

No coin nor oath required. For personal study only.

✦ Synopsis

Alspach, B. and C.-Q. Zhang, Cycle covers of cubic multigraphs, Discrete Mathematics 111 (1993) 11-17.

📜 SIMILAR VOLUMES

Small Circuit Double Covers of Cubic Mul

Small Circuit Double Covers of Cubic Multigraphs

✍ H.J. Lai; X.X. Yu; C.Q. Zhang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 499 KB

Short cycle covers of cubic graphs

✍ Genghua Fan 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 461 KB

## Abstract Let __G__ be a bridgeless cubic graph. We prove that the edges of __G__ can be covered by circuits whose total length is at most (44/27) |__E(G)__|, and if Tutte's 3‐flow Conjecture is true, at most (92/57) |__E(G)__|.

Five Cycle Double Covers of Some Cubic G

Five Cycle Double Covers of Some Cubic Graphs

✍ A. Huck; M. Kochol 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 257 KB

A note on shortest cycle covers of cubic

A note on shortest cycle covers of cubic graphs

✍ Xinmin Hou; Cun-Quan Zhang 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB 👁 1 views

## Abstract Let __SCC__~3~(__G__) be the length of a shortest 3‐cycle cover of a bridgeless cubic graph __G__. It is proved in this note that if __G__ contains no circuit of length 5 (an improvement of Jackson's (__JCTB 1994__) result: if __G__ has girth at least 7) and if all 5‐circuits of __G_

Cycle decompositions of complete multigr

Cycle decompositions of complete multigraphs

✍ Benjamin R. Smith 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

## Abstract In this paper we establish necessary and sufficient conditions for decomposing the complete multigraph λ__K__~__n__~ into cycles of length λ, and the λ‐fold complete symmetric digraph λ__K__ into directed cycles of length λ. As a corollary to these results we obtain necessary and suffic

Cycle decompositions of complete multigr

Cycle decompositions of complete multigraphs

✍ Darryn Bryant; Daniel Horsley; Barbara Maenhaut; Benjamin R. Smith 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB

It is shown that the obvious necessary conditions for the existence of a decomposition of the complete multigraph with n vertices and with k edges joining each pair of distinct vertices into m-cycles, or into m-cycles and a perfect matching, are also sufficient. This result follows as an easy conseq