2017/03/08 by Leopoldo Taravilse, Taravilse, Leopoldo
Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1703.02947
openalex publication_date 2017/03/08 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28
All the work made so far on edge-covering a graph by cliques focus on finding\nthe minimum number of cliques that cover the graph. On this paper, we fix the\nnumber of cliques that cover a graph by the same number of vertices that the\ngraph has, and give an upper bound for the sum of the number of vertices of\nthese cliques in the cases where this covering is possible.\n