Jung-Heum Park, Insung Ihm. A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph. Inf. Process. Lett., 142:57-63, 2019. [doi]
@article{ParkI19,
title = {A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph},
author = {Jung-Heum Park and Insung Ihm},
year = {2019},
doi = {10.1016/j.ipl.2018.10.010},
url = {https://doi.org/10.1016/j.ipl.2018.10.010},
researchr = {https://researchr.org/publication/ParkI19},
cites = {0},
citedby = {0},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {57-63},
}