Packings and Coverings of the Complete Bipartite Graph by Octagons
From MaRDI portal
Publication:5069682
DOI10.1080/09720529.2013.867677zbMATH Open1495.05260OpenAlexW2037946613MaRDI QIDQ5069682FDOQ5069682
Authors: Hui-Juan Zuo, Yulian Miao, Zhihe 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
Recommendations
- Maximum packings of complete graphs with octagons.
- Packings by Complete Bipartite Graphs
- Packing bipartite graphs with covers of complete bipartite graphs
- Packing bipartite graphs with covers of complete bipartite graphs
- Maximum packings and minimum coverings of \(K_{v}\) with octagons
- scientific article; zbMATH DE number 3889575
- Packing the complete bipartite graph with hexagons
- Completing partial packings of bipartite graphs
- Packings in complete graphs
- On packing bipartite graphs
Cites Work
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Packing complete multipartite graphs with 4-cycles
- Title not available (Why is that?)
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- 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*
- Title not available (Why is that?)
- Maximum packings and minimum coverings of \(K_{v}\) with octagons
- Title not available (Why is that?)
- Decomposition of \(K_{m,n}\) into short cycles
- Packing pentagons into complete graphs: How clumsy can you get?
- Cycle systems in the complete bipartite graph minus a one-factor
- Packing the complete bipartite graph with hexagons
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: Packings and Coverings of the Complete Bipartite Graph by Octagons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069682)
