Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00951280n
Noun Concept
Categories: Graph theory objects, NP-complete problems, Computational problems in graph theory
EN
clique cover  clique cover problem  clique cover number  Clique partition  Clique partition problem
EN
In graph theory, a clique cover or partition into cliques of a given undirected graph is a partition of the vertices into cliques, subsets of vertices within which every two vertices are adjacent. Wikipedia
Definitions
Relations
Sources
EN
In graph theory, a clique cover or partition into cliques of a given undirected graph is a partition of the vertices into cliques, subsets of vertices within which every two vertices are adjacent. Wikipedia
IS A
computational problem
PART OF
Karp's 21 NP-complete problems
Wikipedia
EN
clique cover
Wikidata
EN
clique cover problem
Wikipedia Redirections
EN
clique cover number, clique cover problem, Clique partition, Clique partition problem

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License