Optimal path cover problem on block graphs
From MaRDI portal
Publication:1960660
DOI10.1016/S0304-3975(98)00180-7zbMath0930.05093MaRDI QIDQ1960660
Publication date: 12 January 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
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 (15)
Proof that pyramid networks are 1-Hamiltonian-connected with high probability ⋮ Unnamed Item ⋮ On the path partition number of 6‐regular graphs ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. ⋮ Finding a minimum path cover of a distance-hereditary graph in polynomial time ⋮ Node-searching problem on block graphs ⋮ Optimal vertex ranking of block graphs ⋮ Path partition for graphs with special blocks ⋮ The pos/neg-weighted median problem on block graphs with subgraph-shaped customers ⋮ On the dominator coloring in proper interval graphs and block graphs ⋮ The approximability of the weighted Hamiltonian path completion problem on a tree ⋮ Algorithms for maximum internal spanning tree problem for some graph classes ⋮ Corrigendum to ``The path-partition problem in block graphs. ⋮ Solving the path cover problem on circular-arc graphs by using an approximation algorithm
Cites Work
- Linear algorithm for optimal path cover problem on interval graphs
- Minimum node disjoint path covering for circular-arc graphs
- Optimal path cover problem on block graphs and bipartite permutation graphs
- The path-partition problem in block graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimal path cover problem on block graphs
