$N_2$-locally connected graphs and their upper embeddability
Nebeský, Ladislav
Czechoslovak Mathematical Journal, Tome 41 (1991), p. 731-735 / Harvested from Czech Digital Mathematics Library
Access to full text
Full (PDF)
Publié le : 1991-01-01
Classification:  05C10 
@article{102504,
     author = {Ladislav Nebesk\'y},
     title = {$N\_2$-locally connected graphs and their upper embeddability},
     journal = {Czechoslovak Mathematical Journal},
     volume = {41},
     year = {1991},
     pages = {731-735},
     zbl = {0760.05030},
     mrnumber = {1134962},
     language = {en},
     url = {http://dml.mathdoc.fr/item/102504}
}

Nebeský, Ladislav. $N_2$-locally connected graphs and their upper embeddability. Czechoslovak Mathematical Journal, Tome 41 (1991) pp. 731-735. http://gdmltest.u-ga.fr/item/102504/

M. Behzad G. Chartrand; L. Lesniak-Foster Graphs & Digraphs, Prindle, Weber & Schmidt, Boston 1979. (1979) | MR 0525578

G. Chartrand; R. E. Pippert Locally connected graphs, Časopis pěst. mat. 99 (1974), 158-163. (1974) | MR 0398872 | Zbl 0278.05113

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. (1980) | MR 0583198

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. (1980) | MR 0583197

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. (1973) | MR 0422065

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

L. Nebeský Every connected, locally connected graph is upper embeddable, J. Graph Theory 5 (1981), 205-207. (1981) | Article | MR 0615009

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

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

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

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

D. W. Vanderjagt Sufficient conditions for locally connected graphs, Časopis pěst. mat. 99 (1974), 400-404. (1974) | MR 0543786 | Zbl 0294.05123

A. T. White Graphs, Groups, and Surfaces, North-Holland, Amsterdam 1984. (1984) | MR 0780555 | Zbl 0551.05037

N. H. Xuong How to determine the maximum genus of a graph, J. Combinatorial Theory Ser. B26 (1979), 217-225. (1979) | Article | MR 0532589 | Zbl 0403.05035