Abstract
Let c(G) denote the minimum number of cliques necessary to cover all edges of a graph G. A counterexample is provided to a conjecture communicated by P. Erdo{combining double acute accent}s. If c(G - e) < c(G) for every edge e, then G contains no triangles.
Original language | English (US) |
---|---|
Pages (from-to) | 157-160 |
Number of pages | 4 |
Journal | Journal of Combinatorial Theory, Series B |
Volume | 54 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1992 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics