Abstract
A path partition of a graph is a collection of vertex-disjoint paths that cover all vertices of the graph. The path-partition problem is to nd a path partition of minimum size. This paper gives a linear-time algorithm for the path-partition problem in bipartite distance-hereditary graphs.
Citation
Hong-Gwa Yeh. Gerard J. Chang. "THE PATH-PARTITION PROBLEM IN BIPARTITE DISTANCE-HEREDITARY GRAPHS." Taiwanese J. Math. 2 (3) 353 - 360, 1998. https://doi.org/10.11650/twjm/1500406975
Information
