Geodesic
A new characterization of the maximum genus of a graph
Czechoslovak Mathematical Journal, Tome 31 (1981) no. 4, pp. 604-613
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1981.101776
Classification : 05C10, 05C35 
@article{10_21136_CMJ_1981_101776,
     author = {Nebesk\'y, Ladislav},
     title = {A new characterization of the maximum genus of a graph},
     journal = {Czechoslovak Mathematical Journal},
     pages = {604--613},
     year = {1981},
     volume = {31},
     number = {4},
     doi = {10.21136/CMJ.1981.101776},
     mrnumber = {631605},
     zbl = {0482.05034},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1981.101776/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - A new characterization of the maximum genus of a graph
JO  - Czechoslovak Mathematical Journal
PY  - 1981
SP  - 604
EP  - 613
VL  - 31
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1981.101776/
DO  - 10.21136/CMJ.1981.101776
LA  - en
ID  - 10_21136_CMJ_1981_101776
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T A new characterization of the maximum genus of a graph
%J Czechoslovak Mathematical Journal
%D 1981
%P 604-613
%V 31
%N 4
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1981.101776/
%R 10.21136/CMJ.1981.101776
%G en
%F 10_21136_CMJ_1981_101776
Nebeský, Ladislav. A new characterization of the maximum genus of a graph. Czechoslovak Mathematical Journal, Tome 31 (1981) no. 4, pp. 604-613. doi: 10.21136/CMJ.1981.101776

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

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

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

[4] J. Edmonds, D. R. Fulkerson: Transversals and matroid partition. J. Res. Nat. Bur. Stand. В 69 (1965), 147-153. | DOI | MR | Zbl

[5] F. Harary: Graph Theory. Addison-Wesley, Reading (Mass.) 1969. | MR | Zbl

[6] N. P. Homenko: Method of $\fi$-transformations and some its applications. (in Ukrainian, English summary). $\fi$-peretvorennya grafiv (N. P. Homenko, ed.). IM AN URSR, Kiev 1973, pp. 35-96. | MR

[7] N. P. Homenko N. A. Ostroverkhy, V. A. Kusmenko: The maximum genus of a graph. (in Ukrainian, EngHsh summary). ($\fi$-peretvorennya grafiv (N. P. Homenko, ed.). IM AN URSR, Kiev 1973, pp. 180-210.

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

[9] E. A. Nordhaus R. D. Ringeisen В. M. Stewart, and A. T. White: A Kuratowski-type theorem for the maximum genus of a graph. J. Combinatorial Theory 12 В (1972), 260-267. | DOI | MR

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

[11] R. D. Ringeisen: Survey of results on the maximum genus of a graph. J. Graph Theory 3 (1979), 1-13. | DOI | MR | Zbl

[12] G. Ringel: Map Color Theorem. Springer-Verlag, Berlin 1974. | MR | Zbl

[13] W. T. Tutte: On the problem of decomposing a graph into n connected factors. J. London Math. Soc. 36 (1961), 221-230. | MR | Zbl

[14] A. T. White: Graphs of groups on surfaces. In: Combinatorial Surveys: Proceedings of the Sixth British Combinatorial Conference (P. J. Cameron, ed.). Academic Press, London 1977, pp. 165-197. | MR | Zbl

[15] R. J. Wilson: Introduction to Graph Theory. Longman, London 1972. | MR | Zbl

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

[17] J. W. T. Youngs: Minimal embeddings and the genus of a graph. J. Math. Mech. 12 (1963), 303-315. | MR

Cité par Sources :