Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
