𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cycle covering in bridgeless graphs

✍ Scribed by Pierre Fraisse

Book ID
107884220
Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
411 KB
Volume
39
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cycles in Graphs and Covers
Cycles in Graphs and Covers
✍ Dreher, Deanna πŸ“‚ Article πŸ“… 2012 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 426 KB
Covering Graphs by Cycles
Covering Graphs by Cycles
✍ Fan, Genghua πŸ“‚ Article πŸ“… 1992 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 687 KB
A Note onk-walks in Bridgeless Graphs
A Note onk-walks in Bridgeless Graphs
✍ TomΓ‘Ε‘ Kaiser; Roman KuΕΎel; Hao Li; Guanghui Wang πŸ“‚ Article πŸ“… 2007 πŸ› Springer Japan 🌐 English βš– 201 KB
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.

Covering a graph with cycles
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