Chang-Wu Yu, Gen-Huey Chen, Tze-Heng Ma. On the Complexity of the ::::k::::-Chain Subgraph Cover Problem. Theoretical Computer Science, 205(1-2):85-98, 1998. [doi]
@article{YuCM98,
title = {On the Complexity of the ::::k::::-Chain Subgraph Cover Problem},
author = {Chang-Wu Yu and Gen-Huey Chen and Tze-Heng Ma},
year = {1998},
doi = {10.1016/S0304-3975(97)00036-4},
url = {http://dx.doi.org/10.1016/S0304-3975(97)00036-4},
researchr = {https://researchr.org/publication/YuCM98},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {205},
number = {1-2},
pages = {85-98},
}