Insung Ihm, Jung-Heum Park. A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph. Discrete Applied Mathematics, 218:98-112, 2017. [doi]
@article{IhmP17,
title = {A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph},
author = {Insung Ihm and Jung-Heum Park},
year = {2017},
doi = {10.1016/j.dam.2016.10.027},
url = {http://dx.doi.org/10.1016/j.dam.2016.10.027},
researchr = {https://researchr.org/publication/IhmP17},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {218},
pages = {98-112},
}