Skip to Main content Skip to Navigation
New interface
Journal articles

Minimum k-path vertex cover

Abstract : A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by P_k(G) the minimum cardinality of a k-path vertex cover in G. It is shown that the problem of determining P_k(G) is NP-hard for each k ≥ 2, while for trees the problem can be solved in linear time. We investigate upper bounds on the value of P_k(G) and provide several estimations and exact values of P_k(G). We also prove that P_3(G) ≤ (2n + m)/6, for every graph G with n vertices and m edges.
Document type :
Journal articles
Complete list of metadata

Cited literature [32 references]  Display  Hide  Download
Contributor : František Kardoš Connect in order to contact the contributor
Submitted on : Thursday, November 10, 2011 - 9:39:20 AM
Last modification on : Thursday, August 4, 2022 - 4:52:40 PM
Long-term archiving on: : Thursday, November 15, 2012 - 11:41:43 AM


Files produced by the author(s)




Boštjan Brešar, František Kardoš, Ján Katrenič, Gabriel Semanišin. Minimum k-path vertex cover. Discrete Applied Mathematics, 2011, 159 (12), pp.1189-1195. ⟨10.1016/j.dam.2011.04.008⟩. ⟨inria-00634981⟩



Record views


Files downloads