Edge Clique Cover of Claw-free Graphs
Ramin Javadi, Sepehr Hajebi

TL;DR
This paper proves that all connected claw-free graphs with independence number at least three have an edge clique cover number at most equal to their number of vertices, characterizing the cases of equality.
Contribution
It extends the known bound on edge clique cover number from line and quasi-line graphs to all claw-free graphs with independence number at least three, using the structure theorem.
Findings
For connected claw-free graphs with independence number ≥ 3, cc(G) ≤ n.
Equality holds only for specific graphs: icosahedron, twister, or p-th power of cycle.
Provides a complete characterization of extremal graphs for the bound.
Abstract
The smallest number of cliques, covering all edges of a graph , is called the (edge) clique cover number of and is denoted by . It is an easy observation that for every line graph with vertices, . G. Chen et al. [Discrete Math. 219 (2000), no. 1--3, 17--26; MR1761707] extended this observation to all quasi-line graphs and questioned if the same assertion holds for all claw-free graphs. In this paper, using the celebrated structure theorem of claw-free graphs due to Chudnovsky and Seymour, we give an affirmative answer to this question for all claw-free graphs with independence number at least three. In particular, we prove that if is a connected claw-free graph on vertices with , then and equality holds if and only if is either the graph of icosahedron, or the complement of a graph on …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
