The path partition problem and related problems in bipartite graphs

Jérôme Monnot, Sophie Toulouse
2007 Operations Research Letters  
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some approximation and inapproximation results for several related problems.
doi:10.1016/j.orl.2006.12.004 fatcat:xqvtr4qnirhcffwypt35b3ca7e