Geodesic
On locally quasiconnected graphs and their upper embeddability
Czechoslovak Mathematical Journal, Tome 35 (1985) no. 1, pp. 162-166
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1985.102005
Classification : 05C10, 05C40 
@article{10_21136_CMJ_1985_102005,
     author = {Nebesk\'y, Ladislav},
     title = {On locally quasiconnected graphs and their upper embeddability},
     journal = {Czechoslovak Mathematical Journal},
     pages = {162--166},
     year = {1985},
     volume = {35},
     number = {1},
     doi = {10.21136/CMJ.1985.102005},
     mrnumber = {779344},
     zbl = {0584.05031},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1985.102005/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - On locally quasiconnected graphs and their upper embeddability
JO  - Czechoslovak Mathematical Journal
PY  - 1985
SP  - 162
EP  - 166
VL  - 35
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1985.102005/
DO  - 10.21136/CMJ.1985.102005
LA  - en
ID  - 10_21136_CMJ_1985_102005
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T On locally quasiconnected graphs and their upper embeddability
%J Czechoslovak Mathematical Journal
%D 1985
%P 162-166
%V 35
%N 1
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1985.102005/
%R 10.21136/CMJ.1985.102005
%G en
%F 10_21136_CMJ_1985_102005
Nebeský, Ladislav. On locally quasiconnected graphs and their upper embeddability. Czechoslovak Mathematical Journal, Tome 35 (1985) no. 1, pp. 162-166. doi: 10.21136/CMJ.1985.102005

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

[2] G. Chartrand, R. E. Pippert: Locally connected graphs. Časopis pěst. mat. 99 (1974), 158-163. | MR | Zbl

[3] N. P. Homenko N. A. Ostroverkhy, V. A. Kusmenko: The maximum genus of graphs. (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ý: Every connected, locally connected graph is upper embeddable. J. Graph Theory 5 (1981), 205-207. | DOI | MR

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

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

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

[9] A. T. White: Graphs, Groups, and Surfaces. North-Holland, Amsterdam 1973. | Zbl

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

[11] B. Zelinka: Locally tree-like graphs. Časopis pěst. mat. 108 (1983), 230-238. | MR | Zbl

Cité par Sources :