3 citations · 5 across the 4 of their papers we have counts for
4 papers
Editing to Eulerian Graphs
Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof +1
We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let , and denote t…
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…
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…
Obtaining Planarity by Contracting Few Edges
Petr A. Golovach, Pim van 't Hof, Daniel Paulusma
The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is…