Almost resolvable maximum packings of complete graphs with 4-cycles
DOI10.1007/S00373-010-0967-0zbMATH Open1233.05154OpenAlexW2142036861MaRDI QIDQ659680FDOQ659680
Authors: Elizabeth J. Billington, D. G. Hoffman, Italo J. Dejter, C. C. Lindner 
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0967-0
Recommendations
- Maximum (minimum) almost resolvable \((4,2)\)-cycle packing (covering) of a complete graph
- scientific article; zbMATH DE number 5976587
- The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles
- Maximum packings of \(K_ n\) with copies of \(K_ 4-e\)
- Packing complete multipartite graphs with 4-cycles
Extremal problems in graph theory (05C35) Other designs, configurations (05B30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (11)
- Almost resolvable 4-cycle systems
- Packings and coverings of various complete graphs with the 4-cycle with a pendant edge
- Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles
- On the existence of maximum resolvable (\(K_{4} - e\))-packings
- Almost resolvable maximum packings of complete graphs with 5-cycles
- Maximum packing for perfect four-triple configurations
- Packing complete multipartite graphs with 4-cycles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximal cyclic 4-cycle packings and minimal cyclic 4-cycle coverings of the complete graph
- Title not available (Why is that?)
This page was built for publication: Almost resolvable maximum packings of complete graphs with 4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659680)
