Geodesic
Local properties and upper embeddability of connected multigraphs
Czechoslovak Mathematical Journal, Tome 43 (1993) no. 2, pp. 241-248
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1993.128407
Classification : 05C10 
@article{10_21136_CMJ_1993_128407,
     author = {Nebesk\'y, Ladislav},
     title = {Local properties and upper embeddability of connected multigraphs},
     journal = {Czechoslovak Mathematical Journal},
     pages = {241--248},
     year = {1993},
     volume = {43},
     number = {2},
     doi = {10.21136/CMJ.1993.128407},
     mrnumber = {1211746},
     zbl = {0787.05030},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1993.128407/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - Local properties and upper embeddability of connected multigraphs
JO  - Czechoslovak Mathematical Journal
PY  - 1993
SP  - 241
EP  - 248
VL  - 43
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1993.128407/
DO  - 10.21136/CMJ.1993.128407
LA  - en
ID  - 10_21136_CMJ_1993_128407
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T Local properties and upper embeddability of connected multigraphs
%J Czechoslovak Mathematical Journal
%D 1993
%P 241-248
%V 43
%N 2
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1993.128407/
%R 10.21136/CMJ.1993.128407
%G en
%F 10_21136_CMJ_1993_128407
Nebeský, Ladislav. Local properties and upper embeddability of connected multigraphs. Czechoslovak Mathematical Journal, Tome 43 (1993) no. 2, pp. 241-248. doi: 10.21136/CMJ.1993.128407

[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

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

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

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

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

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

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

[9] L. Nebeský: $N_2$-locally connected graphs and their upper embeddability. Czechoslovak Math. J. 41 (116) (1991), 731–735. | MR

[10] R. Nedela, M. Škoviera: On graphs embeddable with short faces. In: Topics in Combinatorics and Graph Theory, R. Bodendiek, R. Henn (eds.), Physica-Verlag, Heidelberg, 1990, pp. 519–529. | MR

[11] Z. Ryjáček: On graphs with isomorphic, non-isomorphic and connected $N_2$-neighbourhoods. Časopis pěst. mat. 12 (1987), 66–79.

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

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

Cité par Sources :