14 citations · 19 across the 8 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2015
The Price of Connectivity for Feedback Vertex Set
Rémy Belmonte, Pim van 't Hof, Marcin Kamiński +1
Let fvs and cfvs(G) denote the cardinalities of a minimum feedback vertex set and a minimum connected feedback vertex set of a graph , respectively. The price of connectivi…
math.CO2013
Maximal induced matchings in triangle-free graphs
Manu Basavaraju, Pinar Heggernes, Pim van 't Hof +2
An induced matching in a graph is a set of edges whose endpoints induce a -regular subgraph. It is known that any -vertex graph has at most maxima…