Geodesic
$N_2$-locally connected graphs and their upper embeddability
Czechoslovak Mathematical Journal, Tome 41 (1991) no. 4, pp. 731-735
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1991.102504
Classification : 05C10 
@article{10_21136_CMJ_1991_102504,
     author = {Nebesk\'y, Ladislav},
     title = {$N_2$-locally connected graphs and their upper embeddability},
     journal = {Czechoslovak Mathematical Journal},
     pages = {731--735},
     year = {1991},
     volume = {41},
     number = {4},
     doi = {10.21136/CMJ.1991.102504},
     mrnumber = {1134962},
     zbl = {0760.05030},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1991.102504/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - $N_2$-locally connected graphs and their upper embeddability
JO  - Czechoslovak Mathematical Journal
PY  - 1991
SP  - 731
EP  - 735
VL  - 41
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1991.102504/
DO  - 10.21136/CMJ.1991.102504
LA  - en
ID  - 10_21136_CMJ_1991_102504
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T $N_2$-locally connected graphs and their upper embeddability
%J Czechoslovak Mathematical Journal
%D 1991
%P 731-735
%V 41
%N 4
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1991.102504/
%R 10.21136/CMJ.1991.102504
%G en
%F 10_21136_CMJ_1991_102504
Nebeský, Ladislav. $N_2$-locally connected graphs and their upper embeddability. Czechoslovak Mathematical Journal, Tome 41 (1991) no. 4, pp. 731-735. doi: 10.21136/CMJ.1991.102504

[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] A. D. Glukhov: On chord-critical graphs. (in Russian). In: Some Topological and Combinatorial Properties of Graphs. Preprint 80.8. IM AN USSR, Kiev 1980, pp. 24-27. | MR

[4] N. P. Homenko, A. D. Glukhov: One-component 2-cell embeddings and the maximum genus of a graph. (in Russian). In: Some Topological and Combinatorial Properties of Graphs. Preprint 80.8 IM AN USSR, Kiev 1980, pp. 5-23. | MR

[5] N. P. Homenko N. A. Ostroverkhy, V. A. Kusmenko: The maximum genus of graphs. (in Ukrainian, English summary). In: $\varphi$-Transformations of Graphs (N. P. Homenko, ed.) IM AN URSR, Kiev 1973, pp. 180-210. | MR

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

[7] L. Nebeský: Every connected, locally connected graph is upper embeddable. J. Graph Theory 5 (1981), 205-207. | DOI | MR

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

[9] L. Nebeský: On locally quasiconnected graphs and their upper embeddability. Czechoslovak Math. J. 35 (110) (1985), 162-166. | MR

[10] Z. Ryjáček: On graphs with isomorphic, non-isomorphic and connected $N\sb 2$-neighbourhoods. Časopis pěst. mat. 112 (1987), 66-79. | MR

[11] J. Sedláček: Local properties of graphs. (in Czech). Časopis pěst. mat. 106 (1981), 290-298. | MR

[12] D. W. VanderJagt: Sufficient conditions for locally connected graphs. Časopis pěst. mat. 99 (1974), 400-404. | MR | Zbl

[13] A. T. White: Graphs, Groups, and Surfaces. North-Holland, Amsterdam 1984. | MR | Zbl

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

Cité par Sources :