The path-partition problem in bipartite distance-hereditary graphs

Title:	The path-partition problem in bipartite distance-hereditary graphs
Authors:	Yeh, HG Chang, GJ 應用數學系 Department of Applied Mathematics
Keywords:	path partition;distance-hereditary graph;Hamiltonian path
Issue Date:	1-Sep-1998
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 find a path partition of minimum size. This paper gives a linear-time algorithm for the path-partition problem in bipartite distance-hereditary graphs.
URI:	http://hdl.handle.net/11536/32440
ISSN:	1027-5487
Journal:	TAIWANESE JOURNAL OF MATHEMATICS
Volume:	2
Issue:	3
Begin Page:	353
End Page:	360
Appears in Collections:	Articles

APA	Yeh, H., & Chang, G. (1998). The path-partition problem in bipartite distance-hereditary graphs. WOS:000078339100009.
Bibtex	@article{Yeh1998The, title={The path-partition problem in bipartite distance-hereditary graphs}, author={Yeh, HG and Chang, GJ}, journal={WOS:000078339100009}, year={1998}, url={https://ir.lib.nycu.edu.tw/handle/11536/32440}, }