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

DOI10.1016/S0020-0190(02)00320-4MaRDI QIDQ1853086zbMATH OpenOpenAlexFDO

Authors 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

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

Review text

Corrigendum to [\textit{J.-H. Yan} and \textit{G. J. Chang}, ibid. 52, No. 6, 317--322 (1994; Zbl 0938.68756)].

Cites work

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

Cited in

(4)

• Correction to: ``On block-schematic Steiner systems \(S(t, t+2, v)\) and \(S(t, t+3, v)\)
• Path partition for graphs with special blocks
• Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm

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

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