2-subcoloring is NP-complete for planar comparability graphs.
Pascal OchemPublished in: Inf. Process. Lett. (2017)
Keyphrases
- np complete
- polynomial time complexity
- bounded treewidth
- randomly generated
- planar graphs
- np hard
- satisfiability problem
- constraint satisfaction problems
- conjunctive queries
- computational complexity
- pspace complete
- data complexity
- np complete problems
- weighted graph
- graph construction
- graph clustering
- planar surfaces
- ground plane
- graph structure
- boolean functions
- graph matching
- description logics
- xml documents