Geodesic
On extremal graphs with no long paths
The electronic journal of combinatorics, Tome 3 (1996) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Connected graphs with minimum degree $\delta$ and at least $2\delta + 1$ vertices have paths with at least $2\delta + 1$ vertices. We provide a characterization of all such graphs which have no longer paths.
DOI : 10.37236/1244
Classification : 05C35, 05C38, 05C75
Mots-clés : extremal graphs, paths, characterization 
@article{10_37236_1244,
     author = {Asad Ali Ali and William Staton},
     title = {On extremal graphs with no long paths},
     journal = {The electronic journal of combinatorics},
     year = {1996},
     volume = {3},
     number = {1},
     doi = {10.37236/1244},
     zbl = {0884.05056},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1244/}
}
TY  - JOUR
AU  - Asad Ali Ali
AU  - William Staton
TI  - On extremal graphs with no long paths
JO  - The electronic journal of combinatorics
PY  - 1996
VL  - 3
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1244/
DO  - 10.37236/1244
ID  - 10_37236_1244
ER  - 
%0 Journal Article
%A Asad Ali Ali
%A William Staton
%T On extremal graphs with no long paths
%J The electronic journal of combinatorics
%D 1996
%V 3
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1244/
%R 10.37236/1244
%F 10_37236_1244
Asad Ali Ali; William Staton. On extremal graphs with no long paths. The electronic journal of combinatorics, Tome 3 (1996) no. 1. doi: 10.37236/1244

Cité par Sources :