Geodesic
A note on upper embeddable graphs
Czechoslovak Mathematical Journal, Tome 33 (1983) no. 1, pp. 37-40
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1983.101853
Classification : 05C10, 05C75 
@article{10_21136_CMJ_1983_101853,
     author = {Nebesk\'y, Ladislav},
     title = {A note on upper embeddable graphs},
     journal = {Czechoslovak Mathematical Journal},
     pages = {37--40},
     year = {1983},
     volume = {33},
     number = {1},
     doi = {10.21136/CMJ.1983.101853},
     mrnumber = {687415},
     zbl = {0518.05029},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1983.101853/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - A note on upper embeddable graphs
JO  - Czechoslovak Mathematical Journal
PY  - 1983
SP  - 37
EP  - 40
VL  - 33
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1983.101853/
DO  - 10.21136/CMJ.1983.101853
LA  - en
ID  - 10_21136_CMJ_1983_101853
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T A note on upper embeddable graphs
%J Czechoslovak Mathematical Journal
%D 1983
%P 37-40
%V 33
%N 1
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1983.101853/
%R 10.21136/CMJ.1983.101853
%G en
%F 10_21136_CMJ_1983_101853
Nebeský, Ladislav. A note on upper embeddable graphs. Czechoslovak Mathematical Journal, Tome 33 (1983) no. 1, pp. 37-40. doi: 10.21136/CMJ.1983.101853

[1] M. Behzad G. Chartrand, L. Lesniak-Forster: Graphs & Digraphs. Prindle, Weber & Schmidt, Boston 1979. | MR

[2] M. Jungerman: A characterization of upper embeddable graphs. Trans. Amer. Math. Soc. 241 (1978), 401-406. | MR | Zbl

[3] L. Nebeský: A new characterization of the maximum genus of a graph. Czechoslovak Math. J. 31 (106) (1981), 604-613. | MR

[4] E. A. Nordhaus В. M. Stewart, A. T. White: On the maximum genus of a graph. J. Combinatorial Theory 11B (1971), 258-267. | DOI | MR

[5] С. Payan, N. H. Xuong: Upper embeddability and connectivity of graphs. Discrete Mathematics 27 (1979), 71 - 80. | DOI | MR | Zbl

[6] R. D. Ringeisen: Survey of results on the maximum genus of a graph. J. Graph Theory 3 (1979), 1-13. | DOI | MR | Zbl

[7] G. Ringel: Map Color Theorem. Springer-Verlag, Berlin 1974. | MR | Zbl

[8] N. H. Xuong: How to determine the maximum genus of a graph. J. Combinatorial Theory 26B (1979), 217-225. | DOI | MR | Zbl

Cité par Sources :