A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The path partition problem and related problems in bipartite graphs
2007
Operations Research Letters
Preserved Fulltext
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