23 citations · 76 across the 30 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
A Polynomial-time Algorithm for Outerplanar Diameter Improvement
Nathann Cohen, Daniel Gonçalves, Eun Jung Kim +4
The Outerplanar Diameter Improvement problem asks, given a graph and an integer , whether it is possible to add edges to in a way that the resulting graph is outerplanar…