scientific article; zbMATH DE number 5976587
From MaRDI portal
Publication:3101003
zbMATH Open1236.05160MaRDI QIDQ3101003FDOQ3101003
Authors: Elizabeth J. Billington, D. G. Hoffman, Mariusz Meszka, C. C. Lindner 
Publication date: 22 November 2011
Title of this publication is not available (Why is that?)
Recommendations
- Maximum (minimum) almost resolvable \((4,2)\)-cycle packing (covering) of a complete graph
- Almost resolvable maximum packings of complete graphs with 4-cycles
- Resolvable coverings of 2-paths by 4-cycles
- Resolvable minimum coverings with quadruples
- scientific article; zbMATH DE number 398945
- Maximal cyclic 4-cycle packings and minimal cyclic 4-cycle coverings of the complete graph
- Covering a graph with cycles of length at least 4
- 4-cycle coverings of the complete graph with a hole
- Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
- The structure of well-covered graphs with no cycles of length 4
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (11)
- Minimum resolvable coverings with small parallel classes
- 4-cycle coverings of the complete graph with a hole
- Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
- Almost resolvable maximum packings of complete graphs with 5-cycles
- Decomposition of product graphs into paths and cycles of length four
- More results on cycle frames and almost resolvable cycle systems
- Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
- Almost resolvable maximum packings of complete graphs with 4-cycles
- Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\)
- Completing the spectrum of almost resolvable cycle systems with odd cycle length
- Maximum (minimum) almost resolvable \((4,2)\)-cycle packing (covering) of a complete graph
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3101003)
