Geodesic
Sharp lower bound for the total number of matchings of tricyclic graphs
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $\mathscr{T}_n$ be the class of tricyclic graphs on $n$ vertices. In this paper, a sharp lower bound for the total number of matchings of graphs in $\mathscr{T}_n$ is determined.
DOI : 10.37236/404
Classification : 05C70, 05C35
Mots-clés : tricyclic graphs, total number of matchings 
@article{10_37236_404,
     author = {Shuchao Li and Zhongxun Zhu},
     title = {Sharp lower bound for the total number of matchings of tricyclic graphs},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/404},
     zbl = {1264.05105},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/404/}
}
TY  - JOUR
AU  - Shuchao Li
AU  - Zhongxun Zhu
TI  - Sharp lower bound for the total number of matchings of tricyclic graphs
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/404/
DO  - 10.37236/404
ID  - 10_37236_404
ER  - 
%0 Journal Article
%A Shuchao Li
%A Zhongxun Zhu
%T Sharp lower bound for the total number of matchings of tricyclic graphs
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/404/
%R 10.37236/404
%F 10_37236_404
Shuchao Li; Zhongxun Zhu. Sharp lower bound for the total number of matchings of tricyclic graphs. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/404

Cité par Sources :