Agnieszka Görlich, Andrzej Zak. Sparse graphs of girth at least five are packable. Discrete Mathematics, 312(24):3606-3613, 2012. [doi]
@article{GorlichZ12,
title = {Sparse graphs of girth at least five are packable},
author = {Agnieszka Görlich and Andrzej Zak},
year = {2012},
doi = {10.1016/j.disc.2012.08.014},
url = {http://dx.doi.org/10.1016/j.disc.2012.08.014},
researchr = {https://researchr.org/publication/GorlichZ12},
cites = {0},
citedby = {0},
journal = {Discrete Mathematics},
volume = {312},
number = {24},
pages = {3606-3613},
}