Edge clique covering sum of graphs

DOI10.1007/S10474-016-0586-1MaRDI QIDQ1701317zbMATH OpenOpenAlexFDO

Authors A. Davoodi, Ramin Javadi, Behnaz Omoomi

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

edge clique cover sum numberedge clique coveringedge clique partitionedge clique partition sum numberset intersection representationset system

Mathematics Subject Classification ID

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

Recommendations

• Clique covering of graphs
• Edge clique covers in graphs with independence number two
• Extremal clique coverings of complementary graphs
• On clique coverings of complete multipartite graphs
• Upper bounds on the edge clique cover number of a graph

Cites work

• Biclique covers and partitions
• Clique partitions of the cocktail party graph
• Covering a graph by complete bipartite graphs
• Covering graphs by the minimum number of equivalence relations
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
• scientific article; zbMATH DE number 3838071 (Why is no real title available?)
• scientific article; zbMATH DE number 3841905 (Why is no real title available?)
• scientific article; zbMATH DE number 4160751 (Why is no real title available?)
• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• scientific article; zbMATH DE number 736306 (Why is no real title available?)
• scientific article; zbMATH DE number 790476 (Why is no real title available?)
• scientific article; zbMATH DE number 878901 (Why is no real title available?)
• Local clique covering of claw-free graphs
• Minimal clique partitions and pairwise balanced designs
• On a clique covering problem of Orlin
• On a problem of G. O. H. Katona and T. Tarján
• On generalized graphs
• On the Decomposition of Graphs
• Pairwise balanced designs and sigma clique partitions
• Proof of a conjecture of Katona and Tarjan
• The Representation of a Graph by Set Intersections

Cited in

(8)

• Clique covering of graphs
• Edge-clique graphs
• On clique coverings of complete multipartite graphs
• scientific article; zbMATH DE number 7310192 (Why is no real title available?)
• Edge clique covers in graphs with independence number two
• The complexity of cluster vertex splitting and company
• On the complexity of establishing hereditary graph properties via vertex splitting
• Upper bounds on the edge clique cover number of a graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701317)