Corrigendum to ``The path-partition problem in block graphs.

DOI10.1016/S0020-0190(02)00320-4zbMath1051.68550OpenAlexW2199025885MaRDI QIDQ1853086

Gerard Jennhwa Chang

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00320-4

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Path partition for graphs with special blocks ⋮ Solving the path cover problem on circular-arc graphs by using an approximation algorithm

Cites Work

• The path-partition problem in block graphs
• Optimal path cover problem on block graphs

This page was built for publication: Corrigendum to ``The path-partition problem in block graphs.