Bujtás, Csilla and Davoodi, Akbar and Győri, Ervin and Tuza, Zsolt (2020) Clique coverings and claw-free graphs. EUROPEAN JOURNAL OF COMBINATORICS, 88. ISSN 0195-6698
|
Text
1-s2.0-S0195669820300354-main.pdf Download (338kB) | Preview |
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 val(C) (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 val(C) (v) is at most k, for every vertex v is an element of V(G). In this paper, among other results, we prove that if G is a claw-free graph, then lcc(G) + chi(G) <= n + 1. (C) 2020 The Author(s). Published by Elsevier Ltd.
| Item Type: | Article |
|---|---|
| Additional Information: | Export Date: 28 August 2020 CODEN: EJOCD Funding details: Institute for Research in Fundamental Sciences, IPM Funding text 1: The second author’s research was supported by a grant from IPM, Iran . Funding Agency and Grant Number: NKFIH, Hungary [116769] Funding text: Research partially supported by the NKFIH, Hungary Grant 116769. |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 23 Sep 2020 09:55 |
| Last Modified: | 23 Sep 2020 09:55 |
| URI: | http://real.mtak.hu/id/eprint/114197 |
Actions (login required)
 |
Edit Item |
