New answers tagged graph-colouring
0
Thanks to M. kanté for pointing out further papers that studied this framework. Reading later papers that deal with vertex partioning problem framework (mostly under the name LS-VSP problems) resolved my confusion on "cofinite" condition.
Short answer: Distance-2 coloring fits in their framework. Every $\exists D_q$-problem in their framework admit ...
Top 50 recent answers are included
Related Tags
graph-colouring × 99graph-theory × 49
cc.complexity-theory × 24
graph-algorithms × 20
co.combinatorics × 15
ds.algorithms × 12
reference-request × 12
planar-graphs × 12
np-hardness × 11
approximation-algorithms × 9
approximation-hardness × 8
hypergraphs × 7
time-complexity × 3
graph-isomorphism × 3
clique × 3
bounded-degree × 3
counting-complexity × 2
np-complete × 2
dc.distributed-comp × 2
parameterized-complexity × 2
open-problem × 2
set-cover × 2
independent-set × 2
complexity-classes × 1
optimization × 1