14 citations · 19 across the 8 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014★ 2 cited
Hadwiger number of graphs with small chordality
Petr A. Golovach, Pinar Heggernes, Pim van 't Hof +1
The Hadwiger number of a graph G is the largest integer h such that G has the complete graph K_h as a minor. We show that the problem of determining the Hadwiger number of a graph…
cs.DS2014
On the Computational Complexity of Vertex Integrity and Component Order Connectivity
Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof
The Weighted Vertex Integrity (wVI) problem takes as input an -vertex graph , a weight function , and an integer . The task is to decide if there exis…