Geodesic
Lower bounds for the average genus of a CF-graph
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

CF-graphs form a class of multigraphs that contains all simple graphs. We prove a lower bound for the average genus of a CF-graph which is a linear function of its Betti number. A lower bound for average genus in terms of the maximum genus and some structure theorems for graphs with a given average genus are also provided.
DOI : 10.37236/422
Classification : 05C10
Mots-clés : cactus free graph, CF-graph, average genus, Betti number 
@article{10_37236_422,
     author = {Yichao Chen},
     title = {Lower bounds for the average genus of a {CF-graph}},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/422},
     zbl = {1204.05040},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/422/}
}
TY  - JOUR
AU  - Yichao Chen
TI  - Lower bounds for the average genus of a CF-graph
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/422/
DO  - 10.37236/422
ID  - 10_37236_422
ER  - 
%0 Journal Article
%A Yichao Chen
%T Lower bounds for the average genus of a CF-graph
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/422/
%R 10.37236/422
%F 10_37236_422
Yichao Chen. Lower bounds for the average genus of a CF-graph. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/422

Cité par Sources :