Additive non-approximability of chromatic number in proper minor-closed classes

Robin Thomas asked whether for every proper minor-closed class G, there exists a polynomial-time algorithm approximating the chromatic number of graphs from G up to a constant additive error independent on the class G. We show this is not the case: unless P=NP, for every integer k≥1, there is no pol...

Full description

Bibliographic Details

Published in:	Journal of combinatorial theory. Series B Vol. 158; pp. 74 - 92
Main Authors:	Dvořák, Zdeněk, Kawarabayashi, Ken-ichi
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.01.2023
Subjects:	Approximation Coloring Minor-closed classes Coloring Minor-closed classes Approximation
ISSN:	0095-8956, 1096-0902
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!