Nonisomorphic maximum packing and minimum covering of K_v with 8-cycles
From MaRDI portal
(Redirected from Publication:354432)
Nonisomorphic maximum packing and minimum covering of \(K v\) with 8-cycles
Nonisomorphic maximum packing and minimum covering of \(K v\) with 8-cycles
Recommendations
Cites work
- scientific article; zbMATH DE number 1076151 (Why is no real title available?)
- scientific article; zbMATH DE number 238427 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Maximum packings and minimum coverings of \(K_{v}\) with octagons
- Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
- Packing and Covering of the Complete Graph with 4-Cycles*
Cited in
(6)- scientific article; zbMATH DE number 2188389 (Why is no real title available?)
- Nonisomorphic packings and covering designs of \(K_v\) with 10-cycles.
- Outside perfect 8-cycle systems
- Maximum packings of inside perfect \(8\)-cycle systems
- Maximum packings of complete graphs with octagons.
- Maximum packings and minimum coverings of \(K_{v}\) with octagons
This page was built for publication: Nonisomorphic maximum packing and minimum covering of \(K_v\) with 8-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354432)