Geodesic
Characterizing the maximum genus of a connected graph
Czechoslovak Mathematical Journal, Tome 43 (1993) no. 1, pp. 177-185
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1993.128386
Classification : 05C10, 05C35 
@article{10_21136_CMJ_1993_128386,
     author = {Nebesk\'y, Ladislav},
     title = {Characterizing the maximum genus of a connected graph},
     journal = {Czechoslovak Mathematical Journal},
     pages = {177--185},
     year = {1993},
     volume = {43},
     number = {1},
     doi = {10.21136/CMJ.1993.128386},
     mrnumber = {1205240},
     zbl = {0788.05033},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1993.128386/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - Characterizing the maximum genus of a connected graph
JO  - Czechoslovak Mathematical Journal
PY  - 1993
SP  - 177
EP  - 185
VL  - 43
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1993.128386/
DO  - 10.21136/CMJ.1993.128386
LA  - en
ID  - 10_21136_CMJ_1993_128386
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T Characterizing the maximum genus of a connected graph
%J Czechoslovak Mathematical Journal
%D 1993
%P 177-185
%V 43
%N 1
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1993.128386/
%R 10.21136/CMJ.1993.128386
%G en
%F 10_21136_CMJ_1993_128386
Nebeský, Ladislav. Characterizing the maximum genus of a connected graph. Czechoslovak Mathematical Journal, Tome 43 (1993) no. 1, pp. 177-185. doi: 10.21136/CMJ.1993.128386

[1] I. Anderson: Perfect matchings of a graph. J. Combinatorial Theory B 10 (1971), 183–186. | DOI | MR | Zbl

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

[3] C. Berge: Théorie des graphes et ses applications. Dunod, Paris, 1958. | MR

[4] J. A. Bondy and U.S.R. Murty: Graph Theory with Applications. MacMillan, London, 1976. | MR

[5] R. A. Duke: The genus, regional number, and Betti number of a graph. Canad. J. Math 18 (1966), 817–822. | DOI | MR | Zbl

[6] P. Hall: On representatives of subsets. J. London Math. Soc. 10 (1935), 26–30. | DOI | Zbl

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

[8] N. P. Homenko, N. A. Ostroverkhy and V. A. Kusmenko: The maximum genus of a graph. In: $\varphi $-Transformations of Graphs, N. P. Homenko (ed.), IM AN URSR, Kiev, 1973, pp. 180–207.

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

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

[11] E. A. Nordhaus, B. M. Stewart and A. T. White: On the maximum genus of a graph. J. Combinatorial Theory B 11 (1971), 258–267. | DOI | MR

[12] R. Rado: A theorem on independence relations. Quart. J. Math. (Oxford) 13 (1942), 83–89. | DOI | MR | Zbl

[13] G. Ringel: The combinatorial map color theorem. J. Graph Theory 1 (1977), 141–155. | DOI | MR | Zbl

[14] J. Širáň: Duke’s theorem does not extend to signed graph embeddings. Discrete Math. 94 (1991), 233–238. | DOI | MR

[15] J. Širáň and M. Škoviera: Characterization of the maximum genus of a signed graph. J. Combinatorial Theory B 52 (1991), 124–146. | DOI | MR

[16] W. T. Tutte: The factorization of linear graphs. J. London Math. Soc. 22 (1947), 107–111. | MR | Zbl

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

[18] R. J. Wilson: Introduction to Graph Theory. Longman Group, London, 1975. | MR

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

Cité par Sources :