TS-Reconfiguration of $k$-Path Vertex Covers in Caterpillars for $k \geq 4$
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, the k-Path Vertex Cover Reconfiguration (k-PVCR) under Token Slidin...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2023-01-01
|
| Series: | Theory and Applications of Graphs |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol10/iss1/8/ |