Density of graphs in which each edge is contained in at least two maximal cliques

DOI10.1515/DMA-2014-0001zbMath1311.05099OpenAlexW2318409069MaRDI QIDQ2344098

Ivan A. Badekha, Pavel V. Roldugin

Publication date: 12 May 2015

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2014-0001

zbMATH Keywords

clique covering of edgescovering of graphs by cliquesinvariants of a graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)

This page was built for publication: Density of graphs in which each edge is contained in at least two maximal cliques