



@article {1793,
	title = {Non-Recursively Constructible Recursive Families of Graphs},
	journal = {The Electronic Journal of Combinatorics},
	volume = {19},
	year = {2012},
	month = {2012/04/16},
	abstract = {In a publication by Noy and Rib{\'o}, it was shown that recursively constructible families of graphs are recursive.  The authors also conjecture that the converse holds; that is, recursive families are also recursively constructible.  In this paper, we provide two specific counterexamples to this conjecture, which we then extend to an infinite family of counterexamples.},
	url = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/2211},
	author = {Colleen Bouey and Christina Graves and Aaron Ostrander and Gregory Palma}
}
