# Clique cover

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Discrete Mathematics
- 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)

Is this relevant?

2017

2017

- ArXiv
- 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

- 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)

Is this relevant?

2012

2012

- ALENEX
- 2012

We consider the problem of edge clique cover on sparse networks and study an application to the identification of overlappingâ€¦Â (More)

Is this relevant?

2012

2012

- WG
- 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

- ACM Journal of Experimental Algorithmics
- 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)

Is this relevant?

2006

2006

- ALENEX
- 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)

Is this relevant?

2006

2006

- Discrete Applied Mathematics
- 2006

Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlapâ€¦Â (More)

Is this relevant?

1988

1988

- J. Comb. Theory, Ser. B
- 1988

Tuckerâ€™s algorithm for recognizing circular-arc graphs [Tl] divides the problem into two cases, one of which is the case whereâ€¦Â (More)

Is this relevant?

1982

1982

- Discrete Mathematics
- 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?