Clique coverings and claw-free graphs

Csilla Bujtás, Akbar Davoodi, Ervin Győri, Zsolt Tuza

Research output: Contribution to journalArticle


Let C be a clique covering for E(G) and let v be a vertex of G. The valency of vertex v (with respect to C), denoted by valC(v), is the number of cliques in 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 valC(v) is at most k, for every vertex v∈V(G). In this paper, among other results, we prove that if G is a claw-free graph, then lcc(G)+χ(G)≤n+1.

Original languageEnglish
Article number103114
JournalEuropean Journal of Combinatorics
Publication statusPublished - Aug 2020

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Clique coverings and claw-free graphs'. Together they form a unique fingerprint.

  • Cite this