Geodesic
On 2-cell embeddings of graphs with minimum numbers of regions
Czechoslovak Mathematical Journal, Tome 35 (1985) no. 4, pp. 625-631
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1985.102053
Classification : 05C10 
@article{10_21136_CMJ_1985_102053,
     author = {Nebesk\'y, Ladislav},
     title = {On 2-cell embeddings of graphs with minimum numbers of regions},
     journal = {Czechoslovak Mathematical Journal},
     pages = {625--631},
     year = {1985},
     volume = {35},
     number = {4},
     doi = {10.21136/CMJ.1985.102053},
     mrnumber = {809045},
     zbl = {0586.05015},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1985.102053/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - On 2-cell embeddings of graphs with minimum numbers of regions
JO  - Czechoslovak Mathematical Journal
PY  - 1985
SP  - 625
EP  - 631
VL  - 35
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1985.102053/
DO  - 10.21136/CMJ.1985.102053
LA  - en
ID  - 10_21136_CMJ_1985_102053
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T On 2-cell embeddings of graphs with minimum numbers of regions
%J Czechoslovak Mathematical Journal
%D 1985
%P 625-631
%V 35
%N 4
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1985.102053/
%R 10.21136/CMJ.1985.102053
%G en
%F 10_21136_CMJ_1985_102053
Nebeský, Ladislav. On 2-cell embeddings of graphs with minimum numbers of regions. Czechoslovak Mathematical Journal, Tome 35 (1985) no. 4, pp. 625-631. doi: 10.21136/CMJ.1985.102053

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

[2] F. Harary: Graph Theory. Addison-Wesley, Reading (Mass.) 1969. | MR | Zbl

[3] N. P. Homenko N. A. Ostroverkhy, and V. A. Kusmenko: The maximum genus of a graph. (in Ukrainian, English summary), $\varphi$-peretvorennya grafiv (N. P. Homenko, ed.) IM AN URSR, Kiev 1973, pp. 180-210. | MR

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

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

[6] L. Nebeský: A note on upper embeddable graphs. Czechoslovak Math. J. 33 (108) (1983), 37-40. | MR

[7] L. Nebeský: On a diffusion of a set of vertices in a connected graph. In: Graphs and Other Combinatorial Topics (Proc. Third Czechoslovak Symp. Graph Theory held in Prague, 1982) (M. Fiedler, ed.), Teubner-Texte zur Mathematik, Band 59, Teubner, Leipzig 1983, pp. 200-203. | MR

[8] E. A. Nordhaus R. D. Ringeisen В. M. Stewart, and A. T. White: A Kuratowski-type theorem for the maximum genus of a graph. J. Combinatorial Theory 12 В (1972), 260-267. | DOI | MR

[9] G. Ringel: The combinatorial map color theorem. J. Graph Theory 1 (1977), 141 - 155. | DOI | MR | Zbl

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

Cité par Sources :