Title:
|
On upper embeddability of complementary graphs (English) |
Author:
|
Nebeský, Ladislav |
Language:
|
English |
Journal:
|
Časopis pro pěstování matematiky |
ISSN:
|
0528-2195 |
Volume:
|
108 |
Issue:
|
2 |
Year:
|
1983 |
Pages:
|
214-217 |
. |
Category:
|
math |
. |
MSC:
|
05C10 |
idZBL:
|
Zbl 0524.05030 |
idMR:
|
MR704067 |
DOI:
|
10.21136/CPM.1983.108415 |
. |
Date available:
|
2009-09-23T09:20:47Z |
Last updated:
|
2020-07-28 |
Stable URL:
|
http://hdl.handle.net/10338.dmlcz/108415 |
. |
Reference:
|
[1] M. Behzad G. Chartrand, L. Lesniak-Foster: Graphs & Digraphs.Prindle, Weber & Schmidt, Boston 1979. MR 0525578 |
Reference:
|
[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 0351870 |
Reference:
|
[3] M. Jungerman: А characterization of upper embeddable graphs.Trans. Аmer. Math. Soc. 241 (1978), 401-406. Zbl 0379.05025, MR 0492309 |
Reference:
|
[4] L. Nebeský: А new characterization of the maximum genus of a graph.Czech. Math. J. 31 (106) (1981), 604-613. MR 0631605 |
Reference:
|
[5] C. Payan, N. H. Xuong: Upper embeddability and connectivity of graphs.Discrete Math. 27 (1979), 71-80. Zbl 0407.05028, MR 0534954 |
Reference:
|
[6] R. D. Ringeisen: Survey of results on the maximum genus of a graph.J. Graph Theory 3 (1979), 1-13. Zbl 0398.05029, MR 0519169 |
Reference:
|
[7] G. Ringel: Map Сolor Theorem.Springer-Verlag, Berlin 1974. MR 0349461 |
Reference:
|
[8] G. Ringel: The combinatorial map color theorem.J. Graph Theory 1 (1977), 141 - 155. Zbl 0386.05030, MR 0444509 |
Reference:
|
[9] S. Stahl: The embeddings of a graph - a survey.J. Graph Theory 2 (1978), 275-298. Zbl 0406.05027, MR 0512799 |
Reference:
|
[10] A. T. White: Graphs, Groups, and Ѕurfaces.North Holland, Аmsterdam 1973. |
Reference:
|
[11] N. H. Xuong: How to determine the maximum genus of a graph.J. Сombinatorial Тheory 26, Ѕer. B (1979), 217-225. Zbl 0403.05035, MR 0532589 |
. |