Non-recursively constructible recursive families of graphs
The electronic journal of combinatorics, Tome 19 (2012) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In a publication by Noy and Ribó, 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.
DOI : 10.37236/2211
Classification : 05C31, 05C50, 05C75
Mots-clés : Tutte polynomial

Colleen Bouey  1   ; Christina Graves  2   ; Aaron Ostrander  3   ; Gregory Palma  4

1 Loyola Marymount College
2 The University of Texas at Tyler
3 Berry College
4 Northeastern State University
@article{10_37236_2211,
     author = {Colleen Bouey and Christina Graves and Aaron Ostrander and Gregory Palma},
     title = {Non-recursively constructible recursive families of graphs},
     journal = {The electronic journal of combinatorics},
     year = {2012},
     volume = {19},
     number = {2},
     doi = {10.37236/2211},
     zbl = {1243.05116},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2211/}
}
TY  - JOUR
AU  - Colleen Bouey
AU  - Christina Graves
AU  - Aaron Ostrander
AU  - Gregory Palma
TI  - Non-recursively constructible recursive families of graphs
JO  - The electronic journal of combinatorics
PY  - 2012
VL  - 19
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2211/
DO  - 10.37236/2211
ID  - 10_37236_2211
ER  - 
%0 Journal Article
%A Colleen Bouey
%A Christina Graves
%A Aaron Ostrander
%A Gregory Palma
%T Non-recursively constructible recursive families of graphs
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/2211/
%R 10.37236/2211
%F 10_37236_2211
Colleen Bouey; Christina Graves; Aaron Ostrander; Gregory Palma. Non-recursively constructible recursive families of graphs. The electronic journal of combinatorics, Tome 19 (2012) no. 2. doi: 10.37236/2211

Cité par Sources :