A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph

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]

Authors

Insung Ihm

This author has not been identified. Look up 'Insung Ihm' in Google

Jung-Heum Park

This author has not been identified. Look up 'Jung-Heum Park' in Google