Clique covers of H-free graphs
It takes <i>n</i><sup>2</sup>/4 cliques to cover all the edges of a complete bipartite graph <i>K</i><sub><i>n/2,n/2</i></sub>, but how many cliques does it take to cover all the edges of a graph <i>G</i> if <i>G</i>...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Elsevier
2023
|