167 citations · 169 across the 2 of their papers we have counts for
2 papers
math.CO2010★ 167 cited
Minimum k-path vertex cover
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…
math.CO2003★ 2 cited
Factorisations and characterisations of induced-hereditary and compositive properties
A. Farrugia, R. Bruce Richter, G. Semanisin
A graph property (i.e., a set of graphs) is induced-hereditary or additive if it is closed under taking induced-subgraphs or disjoint unions. If $\cP$ and $\cQ$ are properties, the…