Closing complexity gaps for coloring problems on H-free graphs.

Petr A. Golovach Daniël Paulusma Jian Song

Published in: Inf. Comput. (2014)

Keyphrases

decision problems
problems involving
np hard
graph matching
np hardness
data sets
data structure
knn
np complete
bipartite graph
graph representation
planar graphs
tractable cases