167 citations · 181 across the 3 of their papers we have counts for
1 paper · 1 filter
Boštjan Brešar, František Kardoš, Ján Katrenič +1
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 ψ_k(G) the minimum cardinality of a…