Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles

DOI10.1007/s00373-004-0601-0zbMath1067.05055OpenAlexW2084699164MaRDI QIDQ2484153

C. A. Rodger, Elizabeth J. Billington, Hung-Lin Fu

Publication date: 28 July 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0601-0

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Nonisomorphic maximum packing and minimum covering of \(K_v\) with 8-cycles ⋮ Unnamed Item ⋮ Maximum cyclic 4-cycle packings of the complete multipartite graph ⋮ Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\) ⋮ Maximum packings and minimum coverings of \(K_{v}\) with octagons ⋮ Closed trail decompositions of some classes of regular graphs

This page was built for publication: Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles