Ihm, Insung; Park, Jung-Heum A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph. (English) Zbl 1352.05175 Discrete Appl. Math. 218, 98-112 (2017). MSC: 05C85 05C40 05C70 05C38 05C45 × Cite Format Result Cite Review PDF Full Text: DOI
Park, Jung-Heum; Ihm, Insung Disjoint path covers in cubes of connected graphs. (English) Zbl 1288.05145 Discrete Math. 325, 65-73 (2014). MSC: 05C40 05C45 05C38 × Cite Format Result Cite Review PDF Full Text: DOI
Park, Jung-Heum; Ihm, Insung Single-source three-disjoint path covers in cubes of connected graphs. (English) Zbl 1285.05106 Inf. Process. Lett. 113, No. 14-16, 527-532 (2013). MSC: 05C40 05C45 × Cite Format Result Cite Review PDF Full Text: DOI