Almost resolvable minimum coverings of complete graphs with 4-cycles

Elizabeth J. Billington, Dean G. Hoffman, Charles C. Lindner, Mariusz Meszka. Almost resolvable minimum coverings of complete graphs with 4-cycles. Australasian J. Combinatorics, 50:73-86, 2011. [doi]

@article{BillingtonHLM11,
  title = {Almost resolvable minimum coverings of complete graphs with 4-cycles},
  author = {Elizabeth J. Billington and Dean G. Hoffman and Charles C. Lindner and Mariusz Meszka},
  year = {2011},
  url = {http://ajc.maths.uq.edu.au/pdf/50/ajc_v50_p073.pdf},
  researchr = {https://researchr.org/publication/BillingtonHLM11},
  cites = {0},
  citedby = {0},
  journal = {Australasian J. Combinatorics},
  volume = {50},
  pages = {73-86},
}