Algorithms and bounds for path covers of tree-structured graphs
From MaRDI portal
Cites work
- An optimal path cover algorithm for cographs
- An upper bound for the path number of a graph
- Characterizations of outerplanar graphs
- Computing Hamiltonian paths with partial order restrictions
- scientific article; zbMATH DE number 3404271 (Why is no real title available?)
- Identifying path covers in graphs
- Maximum nullity of outerplanar graphs and the path cover number
- NP-completeness of some problems of partitioning and covering in graphs
- On Path Cover Problems in Digraphs and Applications to Program Testing
- On three domination-based identification problems in block graphs
- Parameterized algorithms
- Parameterizing path partitions
- Path covering problems and testing of printed circuits
- Path partition for graphs with special blocks
- Polynomial-time algorithms for \textsc{Path Cover} on trees and graphs of bounded treewidth
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm
- The isometric path number of a graph
- The path-partition problem in bipartite distance-hereditary graphs
This page was built for publication: Algorithms and bounds for path covers of tree-structured graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7442706)