Mihalis Beis, William Duckworth, Michele Zito. Large k-Separated Matchings of Random Regular Graphs. In Vladimir Estivill-Castro, editor, Computer Science 2005, Twenty-Eighth Australasian Computer Science Conference (ACSC2005), Newcastle, NSW, Australia, January/February 2005. Volume 38 of CRPIT, pages 175-182, Australian Computer Society, 2005. [doi]
@inproceedings{BeisyDZ05,
title = {Large k-Separated Matchings of Random Regular Graphs},
author = {Mihalis Beis and William Duckworth and Michele Zito},
year = {2005},
url = {http://crpit.com/confpapers/CRPITV38Beis.pdf},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/BeisyDZ05},
cites = {0},
citedby = {0},
pages = {175-182},
booktitle = {Computer Science 2005, Twenty-Eighth Australasian Computer Science Conference (ACSC2005), Newcastle, NSW, Australia, January/February 2005},
editor = {Vladimir Estivill-Castro},
volume = {38},
series = {CRPIT},
publisher = {Australian Computer Society},
isbn = {1-920682-20-1},
}