A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph

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]

Abstract

Abstract is missing.