Geodesic
Characterizing the maximum genus of a connected graph
Czechoslovak Mathematical Journal, Tome 43 (1993) no. 1, pp. 177-185.

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

DOI : 10.21136/CMJ.1993.128386
Classification : 05C10, 05C35 
@article{10_21136_CMJ_1993_128386,
     author = {Nebesk\'y, Ladislav},
     title = {Characterizing the maximum genus of a connected graph},
     journal = {Czechoslovak Mathematical Journal},
     pages = {177--185},
     publisher = {mathdoc},
     volume = {43},
     number = {1},
     year = {1993},
     doi = {10.21136/CMJ.1993.128386},
     mrnumber = {1205240},
     zbl = {0788.05033},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1993.128386/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - Characterizing the maximum genus of a connected graph
JO  - Czechoslovak Mathematical Journal
PY  - 1993
SP  - 177
EP  - 185
VL  - 43
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1993.128386/
DO  - 10.21136/CMJ.1993.128386
LA  - en
ID  - 10_21136_CMJ_1993_128386
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T Characterizing the maximum genus of a connected graph
%J Czechoslovak Mathematical Journal
%D 1993
%P 177-185
%V 43
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1993.128386/
%R 10.21136/CMJ.1993.128386
%G en
%F 10_21136_CMJ_1993_128386
Nebeský, Ladislav. Characterizing the maximum genus of a connected graph. Czechoslovak Mathematical Journal, Tome 43 (1993) no. 1, pp. 177-185. doi : 10.21136/CMJ.1993.128386. http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1993.128386/

Cité par Sources :