Clique Coverings and Claw-free Graphs

TL;DR

This paper investigates the local clique cover number of claw-free graphs and establishes an inequality relating it to the chromatic number and the number of vertices.

Contribution

It proves that for claw-free graphs, the sum of local clique cover number and chromatic number is at most the number of vertices plus one.

Findings

For claw-free graphs, lcc(G)+χ(G) ≤ n+1.

Introduces bounds on local clique cover number in relation to graph properties.

Provides theoretical insights into clique coverings in claw-free graphs.

Abstract

Let $\cal C$ be a clique covering for $E(G)$ and let $v$ be a vertex of $G$. The valency of vertex $v$ (with respect to $\cal C$), denoted by $val_{\cal C}(v)$, is the number of cliques in $\cal C$ containing $v$. The local clique cover number of $G$, denoted by $lcc(G)$, is defined as the smallest integer $k$, for which there exists a clique covering for $E(G)$ such that $val_{\cal C}(v)$ is at most $k$, for every vertex $v\in V(G)$. In this paper, among other results, we prove that if $G$ is a claw-free graph, then $lcc(G)+\chi(G)\leq n+1$.