Optimal path cover problem on block graphs

DOI10.1016/S0304-3975(98)00180-7zbMath0930.05093MaRDI QIDQ1960660

Wong, Pak-ken

Publication date: 12 January 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

block graph; removable edge; end block; extreme cut vertex; minimum path partition

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)