A new characterization of the maximum genus of a graph
Czechoslovak Mathematical Journal, Tome 31 (1981) no. 4, pp. 604-613.

Voir la notice de l'article dans Czech Digital Mathematics Library

DOI : 10.21136/CMJ.1981.101776
Classification : 05C10, 05C35 
@article{10_21136_CMJ_1981_101776,
     author = {Nebesk\'y, Ladislav},
     title = {A new characterization of the maximum genus of a graph},
     journal = {Czechoslovak Mathematical Journal},
     pages = {604--613},
     publisher = {mathdoc},
     volume = {31},
     number = {4},
     year = {1981},
     doi = {10.21136/CMJ.1981.101776},
     mrnumber = {631605},
     zbl = {0482.05034},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/articles/10.21136/CMJ.1981.101776/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - A new characterization of the maximum genus of a graph
JO  - Czechoslovak Mathematical Journal
PY  - 1981
SP  - 604
EP  - 613
VL  - 31
IS  - 4
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/articles/10.21136/CMJ.1981.101776/
DO  - 10.21136/CMJ.1981.101776
LA  - en
ID  - 10_21136_CMJ_1981_101776
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T A new characterization of the maximum genus of a graph
%J Czechoslovak Mathematical Journal
%D 1981
%P 604-613
%V 31
%N 4
%I mathdoc
%U https://geodesic-test.mathdoc.fr/articles/10.21136/CMJ.1981.101776/
%R 10.21136/CMJ.1981.101776
%G en
%F 10_21136_CMJ_1981_101776
Nebeský, Ladislav. A new characterization of the maximum genus of a graph. Czechoslovak Mathematical Journal, Tome 31 (1981) no. 4, pp. 604-613. doi : 10.21136/CMJ.1981.101776. https://geodesic-test.mathdoc.fr/articles/10.21136/CMJ.1981.101776/

Cité par Sources :