Nonisomorphic maximum packing and minimum covering of \(K_v\) with 8-cycles
type: Item
instance of: scholarly article
title: Nonisomorphic maximum packing and minimum covering of \(K_v\) with 8-cycles
zbMATH Open document ID: 1268.05159
author: Mingchao Li
author: Jingjing Huo
author: Qingde Kang
published in: Graphs and Combinatorics
publication date: 2013-07-19T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6189449
zbMATH Keywords: maximum packing
zbMATH Keywords: minimum covering
zbMATH Keywords: \(C_n\)-min\(CD(v)\)
zbMATH Keywords: nonisomorphic \((v, \frac{v}{2}+s)\)-graph
zbMATH Keywords: leave
zbMATH Keywords: excess
MaRDI profile type: Publication
full work available at URL: s00373-012-1167-x
OpenAlex ID: W1974312442
cites work: Cycle decompositions of \(K_n\) and \(K_n-I\)
cites work: Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
cites work: Q5572939
cites work: Q5287866
cites work: Q4359595
cites work: Maximum packings and minimum coverings of \(K_{v}\) with octagons
cites work: Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
cites work: Packing and Covering of the Complete Graph with 4-Cycles*
DOI: 10.1007/S00373-012-1167-X
description: scientific article; zbMATH DE number 6189449