1. Adhar, G.S., Peng, S.: Parallel algorithm for path covering, Hamiltonian path, and Hamiltonian cycle in cographs. In: International Conference on Parallel Processing, vol. III: Algorithms and Architecture, pp. 364–365. Pennsylvania State University Press, Pennsylvania (1990)
2. Arikati, S.R., Rangan, C.P.: Linear algorithm for optimal path cover problem on interval graphs. Inf. Process. Lett. 35, 149–153 (1990)
3. Asdre, K., Nikolopoulos, S.D.: A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs. Networks 50, 231–240 (2007)
4. Asdre, K., Nikolopoulos, S.D.: A polynomial solution for the k-fixed-endpoint path cover problem on proper interval graphs. In: Proc. of the 18th International Conference on Combinatorial Algorithms (IWOCA’07), Lake Macquarie, Newcastle, Australia (2007)
5. Bertossi, A.A.: Finding Hamiltonian circuits in proper interval graphs. Inf. Process. Lett. 17, 97–101 (1983)