NoteA note about shortest cycle covers
Under an Elsevier user license
open archive
Keywords
Cycle cover
Shortest cycle cover
Odd-edge connectivity
r-graph
Cited by (0)
- 1
Partially supported by National Natural Science Foundation of China under Grants no. 19671029 and 10271048 and Shanghai Priority Academic Discipline.
- 2
Partially supported by the National Security Agency under Grants MDA904-01-1-0022 and MSPR-03G-023.
Copyright © 2005 Elsevier B.V. All rights reserved.