Cerdeira, J. Orestes. "On the complexity of covering nodes by K node-disjoint cycles." Portugaliae mathematica 45.1 (1988): 25-27. <http://eudml.org/doc/115605>.
@article{Cerdeira1988, author = {Cerdeira, J. Orestes}, journal = {Portugaliae mathematica}, keywords = {cycle covering; NP-completeness; undirected graph}, language = {eng}, number = {1}, pages = {25-27}, publisher = {Sociedade Portuguesa de Matemática}, title = {On the complexity of covering nodes by K node-disjoint cycles}, url = {http://eudml.org/doc/115605}, volume = {45}, year = {1988}, }
TY - JOUR AU - Cerdeira, J. Orestes TI - On the complexity of covering nodes by K node-disjoint cycles JO - Portugaliae mathematica PY - 1988 PB - Sociedade Portuguesa de Matemática VL - 45 IS - 1 SP - 25 EP - 27 LA - eng KW - cycle covering; NP-completeness; undirected graph UR - http://eudml.org/doc/115605 ER -
