31 citations · 256 across the 67 of their papers we have counts for
Showing 2017 · cs.DMShow all
2 papers · 2 filters
cs.DM2017
Additive non-approximability of chromatic number in proper minor-closed classes
Zdeněk Dvořák, Ken-ichi Kawarabayashi
Robin Thomas asked whether for every proper minor-closed class C, there exists a polynomial-time algorithm approximating the chromatic number of graphs from C up to a constant addi…
cs.DM2017★ 1 cited
Thin graph classes and polynomial-time approximation schemes
Zdeněk Dvořák
Baker devised a powerful technique to obtain approximation schemes for various problems restricted to planar graphs. Her technique can be directly extended to various other graph c…