Pairwise balanced designs and sigma clique partitions
From MaRDI portal
Publication:271601
DOI10.1016/j.disc.2015.09.008zbMath1333.05040arXiv1411.0266MaRDI QIDQ271601
Akbar Davoodi, Ramin Javadi, Behnaz Omoomi
Publication date: 7 April 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.0266
05B05: Combinatorial aspects of block designs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Edge clique covering sum of graphs, Clique coverings and claw-free graphs, On clique coverings of complete multipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the number of blocks in a perfect covering of v points
- Clique partitions of the cocktail party graph
- Minimal clique partitions and pairwise balanced designs
- Clique partitions and clique coverings
- Proof of a conjecture of Katona and Tarjan
- Asymptotic values of clique partition numbers
- A retrospective look at the Erdös-DeBruijn theorem
- The Difference Between Consecutive Primes, II
- On a problem of G. O. H. Katona and T. Tarján
- On the Decomposition of Graphs