𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Five Cycle Double Covers of Some Cubic Graphs

✍ Scribed by A. Huck; M. Kochol

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
257 KB
Volume
64
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Short cycle covers of cubic graphs
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)__|.

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_

Minimum cycle covers of graphs
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.

Shortest Circuit Covers of Cubic Graphs
Shortest Circuit Covers of Cubic Graphs
✍ B. Jackson πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 298 KB

We show that the edge set of a bridgeless cubic graph \(G\) can be covered with circuits such that the sum of the lengths of the circuits is at most \(\frac{64}{39}|E(G)|\). Stronger results are obtained for cubic graphs of large girth. 1994 Academic Press, Inc.

Counting double covers of graphs
Counting double covers of graphs
✍ M. Hofmeister πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 288 KB

Any group of automorphisms of a graph G induces a notion of isomorphism between double covers of G. The corresponding isomorphism classes will be counted.