The path-partition problem in bipartite distance-hereditary graphs

DOI10.11650/TWJM/1500406975MaRDI QIDQ1272711zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Finding a minimum path cover of a distance-hereditary graph in polynomial time
• scientific article; zbMATH DE number 815104
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• Recognition of probe distance-hereditary graphs
• Dominating cliques in distance-hereditary graphs

Cited in

(14)

• Recognition of probe distance-hereditary graphs
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm
• The Hamiltonian problem on distance-hereditary graphs
• On the Galois lattice of bipartite distance hereditary graphs
• Algorithms for solving problems on graphs of bounded pathwidth
• Path partition for graphs with special blocks
• On the jump number problem in hereditary classes of bipartite graphs
• Finding a minimum path cover of a distance-hereditary graph in polynomial time
• scientific article; zbMATH DE number 205350 (Why is no real title available?)
• scientific article; zbMATH DE number 815104 (Why is no real title available?)
• Linear \(k\)-arboricities on trees
• On partitioning simple bipartite graphs in vertex-disjoint paths
• Computing maximum stable sets for distance-hereditary graphs
• A boundary class for the \(k\)-path partition problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1272711)