A note about shortest cycle covers

doi:10.1016/j.disc.2005.06.013

Discrete Mathematics

Volume 301, Issues 2–3, 6 October 2005, Pages 232-238

https://doi.org/10.1016/j.disc.2005.06.013 Get rights and content

Under an Elsevier user license

open archive

Abstract

Let G be a graph with odd edge-connectivity r. It is proved in this paper that if $r > 3$ , then G has a 3-cycle $(1, 2)$ -cover of total length at most $((r + 1) | E (G) |) / r$ .

Keywords

Cycle cover

Shortest cycle cover

Odd-edge connectivity

r-graph

Cited by (0)

¹: Partially supported by National Natural Science Foundation of China under Grants no. 19671029 and 10271048 and Shanghai Priority Academic Discipline.

²: Partially supported by the National Security Agency under Grants MDA904-01-1-0022 and MSPR-03G-023.

Discrete Mathematics

NoteA note about shortest cycle covers

Abstract

Keywords

Note
A note about shortest cycle covers