Non-recursively constructible recursive families of graphs (Q426873)

Summary: In a publication by \textit{M. Noy} and \textit{A. Ribó} [Adv. Appl. Math. 32, No. 1--2, 350--363 (2004; Zbl 1041.05050)], 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.