Optimal path cover problem on block graphs
type: Item
instance of: scholarly article
title: Optimal path cover problem on block graphs
zbMATH Open document ID: 0930.05093
DOI: 10.1016/S0304-3975(98)00180-7
published in: Theoretical Computer Science
publication date: 2000-01-12T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1387548
zbMATH Keywords: minimum path partition
zbMATH Keywords: block graph
zbMATH Keywords: end block
zbMATH Keywords: extreme cut vertex
zbMATH Keywords: removable edge
author: Wong, Pak-ken
MaRDI profile type: Publication
cites work: Linear algorithm for optimal path cover problem on interval graphs
cites work: Q5422499
cites work: Minimum node disjoint path covering for circular-arc graphs
cites work: Q3883524
cites work: Q3684121
cites work: Q3328583
cites work: Q4097319
cites work: Optimal path cover problem on block graphs and bipartite permutation graphs
cites work: The path-partition problem in block graphs
description: scientific article; zbMATH DE number 1387548