Geodesic
Certain cubic multigraphs and their upper embeddability
Czechoslovak Mathematical Journal, Tome 45 (1995) no. 3, pp. 385-392
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1995.128539
Classification : 05C10 
@article{10_21136_CMJ_1995_128539,
     author = {Nebesk\'y, Ladislav},
     title = {Certain cubic multigraphs and their upper embeddability},
     journal = {Czechoslovak Mathematical Journal},
     pages = {385--392},
     year = {1995},
     volume = {45},
     number = {3},
     doi = {10.21136/CMJ.1995.128539},
     mrnumber = {1344505},
     zbl = {0839.05033},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1995.128539/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - Certain cubic multigraphs and their upper embeddability
JO  - Czechoslovak Mathematical Journal
PY  - 1995
SP  - 385
EP  - 392
VL  - 45
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1995.128539/
DO  - 10.21136/CMJ.1995.128539
LA  - en
ID  - 10_21136_CMJ_1995_128539
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T Certain cubic multigraphs and their upper embeddability
%J Czechoslovak Mathematical Journal
%D 1995
%P 385-392
%V 45
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1995.128539/
%R 10.21136/CMJ.1995.128539
%G en
%F 10_21136_CMJ_1995_128539
Nebeský, Ladislav. Certain cubic multigraphs and their upper embeddability. Czechoslovak Mathematical Journal, Tome 45 (1995) no. 3, pp. 385-392. doi: 10.21136/CMJ.1995.128539

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

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

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

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

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

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

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

[8] L. Nebeský: Local properties and upper embeddability of connected graphs. Czechoslovak Math. J. 43(118) (1993) (to appear), 241–248. | MR

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

[10] A. T. White: Graphs, Groups, and Surfaces. Revised Edition. North-Holland, Amsterdam, 1984. | MR

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

Cité par Sources :