The path-partition problem in bipartite distance-hereditary graphs

DOI10.11650/twjm/1500406975zbMath0917.05069OpenAlexW1943088022MaRDI QIDQ1272711

Hong-Gwa Yeh, Gerard Jennhwa Chang

Publication date: 3 January 1999

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500406975

zbMATH Keywords

polynomial algorithmdistance-hereditarypath-covering

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Unnamed Item ⋮ Path partition for graphs with special blocks ⋮ The Hamiltonian problem on distance-hereditary graphs ⋮ A boundary class for the \(k\)-path partition problem ⋮ Linear \(k\)-arboricities on trees ⋮ Solving the path cover problem on circular-arc graphs by using an approximation algorithm

This page was built for publication: The path-partition problem in bipartite distance-hereditary graphs