The path partition problem and related problems in bipartite graphs

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.

• Type: Journal
• Year: 2007
• Where: ORL
• Authors: Jérôme Monnot, Sophie Toulouse
• Keywords: Bipartite Graph, Maximum Degree, Nk Vertices, ORL 2007