Clique cover

Known as: Clique cover number, Clique partition problem, Clique cover problem 
In graph theory, a clique cover or partition into cliques of a given undirected graph is a partition of the vertices of the graph into cliques… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We show that f (x) = ⌊ 2 x⌋ is a θ-bounding function for the class of subcubic graphs and that it is best possible. This… (More)
  • figure 1
  • figure 2
Is this relevant?
2017
2017
We give an O(n) algorithm to find a minimum clique cover of a (bull, C4)-free graph, or equivalently, a minimum colouring of a… (More)
Is this relevant?
2016
2016
A graph is (H1,H2)-free for a pair of graphs H1, H2 if it contains no induced subgraph isomorphic to H1 or H2. In 2001, Král… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2012
2012
We consider the problem of edge clique cover on sparse networks and study an application to the identification of overlapping… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
Is this relevant?
2012
2012
The only available combinatorial algorithm for the minimum weighted clique cover (mwcc) in claw-free perfect graphs is due to Hsu… (More)
Is this relevant?
2008
2008
To cover the edges of a graph with a minimum number of cliques is an NP-hard problem with many applications. For this problem we… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
2006
2006
To cover the edges of a graph with a minimum number of cliques is an NP-complete problem with many applications. The state-of-the… (More)
  • figure 1
  • figure 3
  • table 1
  • figure 5
  • figure 6
Is this relevant?
2006
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1988
1988
Tucker’s algorithm for recognizing circular-arc graphs [Tl] divides the problem into two cases, one of which is the case where… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1982
1982
Let G = (V, E) be a graph with a positive number wt(v) assigned to each L’ E V. A weighted clique saver of the vertices of G is a… (More)
Is this relevant?