Login / Signup
Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs.
Janka Chlebíková
Clément Dallard
Published in:
CoRR (2019)
Keyphrases
</>
planar graphs
np complete
optimization problems
vertex cover
computational complexity
closed form