Open Access. Powered by Scholars. Published by Universities.®
![Digital Commons Network](http://assets.bepress.com/20200205/img/dcn/DCsunburst.png)
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Physical Sciences and Mathematics
Ts-Reconfiguration Of K-Path Vertex Covers In Caterpillars For K \Geq 4, Duc A. Hoang
Ts-Reconfiguration Of K-Path Vertex Covers In Caterpillars For K \Geq 4, Duc A. Hoang
Theory and Applications of Graphs
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 placed on each vertex of a k-PVC. Given two k-PVCs I, J of a graph G, thek-Path Vertex Cover Reconfiguration (k-PVCR)} under Token Sliding (TS) problem asks if there is a sequence of k-PVCs between I and J where each intermediate member is obtained from its predecessor by sliding a token from some …