Packings and Coverings of the Complete Bipartite Graph by Octagons
From MaRDI portal
Publication:5069682
DOI10.1080/09720529.2013.867677zbMath1495.05260OpenAlexW2037946613MaRDI QIDQ5069682
Yulian Miao, Hui-Juan Zuo, Zhi-He Liang
Publication date: 19 April 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2013.867677
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum packings and minimum coverings of \(K_{v}\) with octagons
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Decomposition of \(K_{m,n}\) into short cycles
- Packing pentagons into complete graphs: How clumsy can you get?
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Cycle systems in the complete bipartite graph minus a one-factor
- Packing complete multipartite graphs with 4-cycles
- Cycle decompositions III: Complete graphs and fixed length cycles
- A survey on the existence ofG-Designs
- Packing and Covering of the Complete Graph with 4-Cycles*
This page was built for publication: Packings and Coverings of the Complete Bipartite Graph by Octagons
