Elizabeth J. Billington, Italo J. Dejter, Dean G. Hoffman, Charles Curtis Lindner. Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles. Graphs and Combinatorics, 27(2):161-170, 2011. [doi]
@article{BillingtonDHL11,
title = {Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles},
author = {Elizabeth J. Billington and Italo J. Dejter and Dean G. Hoffman and Charles Curtis Lindner},
year = {2011},
doi = {10.1007/s00373-010-0967-0},
url = {http://dx.doi.org/10.1007/s00373-010-0967-0},
tags = {completeness, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BillingtonDHL11},
cites = {0},
citedby = {0},
journal = {Graphs and Combinatorics},
volume = {27},
number = {2},
pages = {161-170},
}