Edge clique covering sum of graphs
type: Item
instance of: scholarly article
title: Edge clique covering sum of graphs
zbMATH Open document ID: 1399.05179
author: A. Davoodi
author: Ramin Javadi
author: Behnaz Omoomi
published in: Acta Mathematica Hungarica
publication date: 2018-02-22T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05D05
zbMATH DE Number: 6842468
zbMATH Keywords: edge clique covering
zbMATH Keywords: edge clique partition
zbMATH Keywords: edge clique cover sum number
zbMATH Keywords: edge clique partition sum number
zbMATH Keywords: set intersection representation
zbMATH Keywords: set system
MaRDI profile type: Publication
full work available at URL: s10474-016-0586-1
OpenAlex ID: W2281219482
cites work: Covering graphs by the minimum number of equivalence relations
cites work: On generalized graphs
cites work: On the Decomposition of Graphs
cites work: Q3312268
cites work: Pairwise balanced designs and sigma clique partitions
cites work: The Representation of a Graph by Set Intersections
cites work: Covering a graph by complete bipartite graphs
cites work: On a problem of G. O. H. Katona and T. Tarján
cites work: Clique partitions of the cocktail party graph
cites work: On a clique covering problem of Orlin
cites work: Local Clique Covering of Claw-Free Graphs
cites work: Proof of a conjecture of Katona and Tarjan
cites work: Q4846548
cites work: Q4152571
cites work: Biclique covers and partitions
cites work: Q3309876
cites work: Minimal clique partitions and pairwise balanced designs
cites work: Q4326650
cites work: Q4878671
cites work: Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
cites work: Q3487359
DOI: 10.1007/S10474-016-0586-1
description: scientific article; zbMATH DE number 6842468