Edge clique covering sum of graphs

DOI10.1007/s10474-016-0586-1zbMath1399.05179OpenAlexW2281219482MaRDI QIDQ1701317

Akbar Davoodi, Behnaz Omoomi, Ramin Javadi

Publication date: 22 February 2018

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10474-016-0586-1

zbMATH Keywords

set systemedge clique partitionedge clique cover sum numberedge clique coveringedge clique partition sum numberset intersection representation

Mathematics Subject Classification ID

Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

On clique coverings of complete multipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pairwise balanced designs and sigma clique partitions
• Biclique covers and partitions
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• Clique partitions of the cocktail party graph
• Minimal clique partitions and pairwise balanced designs
• Covering graphs by the minimum number of equivalence relations
• Proof of a conjecture of Katona and Tarjan
• On a clique covering problem of Orlin
• Covering a graph by complete bipartite graphs
• Local Clique Covering of Claw-Free Graphs
• On a problem of G. O. H. Katona and T. Tarján
• On the Decomposition of Graphs
• The Representation of a Graph by Set Intersections
• On generalized graphs

This page was built for publication: Edge clique covering sum of graphs