Geodesic
On upper embeddability of complementary graphs
Časopis pro pěstování matematiky, Tome 108 (1983) no. 2, pp. 214-217

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

DOI MR   Zbl

DOI : 10.21136/CPM.1983.108415
Classification : 05C10 
Nebeský, Ladislav. On upper embeddability of complementary graphs. Časopis pro pěstování matematiky, Tome 108 (1983) no. 2, pp. 214-217. doi: 10.21136/CPM.1983.108415
@article{10_21136_CPM_1983_108415,
     author = {Nebesk\'y, Ladislav},
     title = {On upper embeddability of complementary graphs},
     journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
     pages = {214--217},
     year = {1983},
     volume = {108},
     number = {2},
     doi = {10.21136/CPM.1983.108415},
     mrnumber = {704067},
     zbl = {0524.05030},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1983.108415/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - On upper embeddability of complementary graphs
JO  - Časopis pro pěstování matematiky
PY  - 1983
SP  - 214
EP  - 217
VL  - 108
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1983.108415/
DO  - 10.21136/CPM.1983.108415
LA  - en
ID  - 10_21136_CPM_1983_108415
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T On upper embeddability of complementary graphs
%J Časopis pro pěstování matematiky
%D 1983
%P 214-217
%V 108
%N 2
%U http://geodesic.mathdoc.fr/articles/10.21136/CPM.1983.108415/
%R 10.21136/CPM.1983.108415
%G en
%F 10_21136_CPM_1983_108415

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

[2] N. P. Homenko N. A. Ostroverkhy, V. A. Kusmenko: The maximum genus of a graph. (in Ukrainian, English summary). φ-peretvorennya grafiv (N. P. Homenko, ed.). IМ АN URSR, Kiev 1973, pp. 180-210. | MR

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

[4] L. Nebeský: А new characterization of the maximum genus of a graph. Czech. Math. J. 31 (106) (1981), 604-613. | MR

[5] C. Payan, N. H. Xuong: Upper embeddability and connectivity of graphs. Discrete Math. 27 (1979), 71-80. | MR | Zbl

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

[7] G. Ringel: Map Сolor Theorem. Springer-Verlag, Berlin 1974. | MR

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

[9] S. Stahl: The embeddings of a graph - a survey. J. Graph Theory 2 (1978), 275-298. | MR | Zbl

[10] A. T. White: Graphs, Groups, and Ѕurfaces. North Holland, Аmsterdam 1973.

[11] N. H. Xuong: How to determine the maximum genus of a graph. J. Сombinatorial Тheory 26, Ѕer. B (1979), 217-225. | MR | Zbl

Cité par Sources :