Geodesic
Asymptotic enumeration on self-similar graphs with two boundary vertices
Discrete mathematics & theoretical computer science, Tome 11 (2009) no. 1 Cet article a éte moissonné depuis la source Episciences

Voir la notice de l'article

Combinatorics 
@article{DMTCS_2009_11_1_a10,
     author = {Teufl, Elmar and Wagner, Stephan},
     title = {Asymptotic enumeration on self-similar graphs with two boundary vertices},
     journal = {Discrete mathematics & theoretical computer science},
     year = {2009},
     volume = {11},
     number = {1},
     doi = {10.46298/dmtcs.471},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.471/}
}
TY  - JOUR
AU  - Teufl, Elmar
AU  - Wagner, Stephan
TI  - Asymptotic enumeration on self-similar graphs with two boundary vertices
JO  - Discrete mathematics & theoretical computer science
PY  - 2009
VL  - 11
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.471/
DO  - 10.46298/dmtcs.471
LA  - en
ID  - DMTCS_2009_11_1_a10
ER  - 
%0 Journal Article
%A Teufl, Elmar
%A Wagner, Stephan
%T Asymptotic enumeration on self-similar graphs with two boundary vertices
%J Discrete mathematics & theoretical computer science
%D 2009
%V 11
%N 1
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.471/
%R 10.46298/dmtcs.471
%G en
%F DMTCS_2009_11_1_a10
Teufl, Elmar; Wagner, Stephan. Asymptotic enumeration on self-similar graphs with two boundary vertices. Discrete mathematics & theoretical computer science, Tome 11 (2009) no. 1. doi: 10.46298/dmtcs.471

Cité par Sources :