Packing complete multipartite graphs with 4-cycles
From MaRDI portal
Publication:2713360
DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6610(2001)9:2<107::AID-JCD1002>3.0.CO;2-M" /><107::AID-JCD1002>3.0.CO;2-M 10.1002/1520-6610(2001)9:2<107::AID-JCD1002>3.0.CO;2-MzbMath0971.05091OpenAlexW2014187938MaRDI QIDQ2713360
C. A. Rodger, Elizabeth J. Billington, Hung-Lin Fu
Publication date: 21 October 2001
Full work available at URL: https://doi.org/10.1002/1520-6610(2001)9:2<107::aid-jcd1002>3.0.co;2-m
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (7)
Equitable block-colorings of \(C_4\)-decompositions of \(K_v-F\) ⋮ Packings and Coverings of the Complete Bipartite Graph by Octagons ⋮ Unnamed Item ⋮ Maximum cyclic 4-cycle packings of the complete multipartite graph ⋮ Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\) ⋮ Enclosings of \(\lambda \)-fold 4-cycle systems ⋮ 4-cycle decompositions of \((\lambda +m)K_{v+u} {\setminus } \lambda K_v\)
Cites Work
This page was built for publication: Packing complete multipartite graphs with 4-cycles
