On the complexity of finding a minimum cycle cover of a graph

Research output: Contribution to journal › Journal article › Research › peer-review

OpenUrl availability

@article{15ecb7c71cbd46ff9d32a4c4dd8cf7f5,

title = "On the complexity of finding a minimum cycle cover of a graph",

author = "Carsten Thomassen",

year = "1997",

language = "English",

volume = "26",

pages = "675--677",

journal = "S I A M Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics",

}