TS-Reconfiguration of -Path Vertex Covers in Caterpillars for
DA Hoang - arXiv preprint arXiv:2203.11667, 2022 - arxiv.org
A $ k $-path vertex cover ($ k $-PVC) of a graph $ G $ is a vertex subset $ I $ such that each
path on $ k $ vertices in $ G $ contains at least one member of $ I $. Imagine that a token is …
path on $ k $ vertices in $ G $ contains at least one member of $ I $. Imagine that a token is …