Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
From MaRDI portal
Publication:2311707
DOI10.1007/s10114-019-8005-5zbMath1415.05150OpenAlexW2941501768MaRDI QIDQ2311707
Tao Feng, Yan Xun Chang, Yu-feng Gao
Publication date: 4 July 2019
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-019-8005-5
Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)
Related Items (2)
Kite-group divisible packings and coverings with any minimum leave and minimum excess ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges
- Minimal coverings of pairs by triples
- Packing cycles in complete graphs
- Packing paths in complete graphs
- \(G\)-decomposition of \(K_n\), where G has four vertices or less
- On group divisible covering designs
- Maximum packings of \(K_ n\) with copies of \(K_ 4-e\)
- Maximum cyclic 4-cycle packings of the complete multipartite graph
- Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\)
- Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
- On the covering of pairs by quadruples. I
- On the covering of pairs by quadruples. II
- Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\)
- Group divisible packings and coverings with any minimum leave and minimum excess
- Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit
- Maximum packings of the complete graph with uniform length cycles
- A survey on the existence ofG-Designs
- Maximum packings of uniform group divisible triple systems
- Minimum embedding of P3-designs into (K4?e)-designs
This page was built for publication: Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
