Edge clique covering sum of graphs
From MaRDI portal
Publication:1701317
DOI10.1007/s10474-016-0586-1zbMath1399.05179MaRDI 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
set system; edge clique partition; edge clique cover sum number; edge clique covering; edge clique partition sum number; set intersection representation
05D05: Extremal set theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
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