A characterization of embeddability of graphs on surfaces
โ Scribed by Liu Ying; Liu Yanpei
- Publisher
- SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
- Year
- 1998
- Tongue
- English
- Weight
- 314 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1005-1031
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
%rSiI. J.. Characterization of signed graphs which are cellularly emheddahle in no more than one surface. Discrete Mathematics 94 (1991) 39-44. We consider embeddings of signed graphs in which the balanced cycles of .he graph mducs orientation-preserving cycles on the surface. and characterize those
In this paper, by using the Discharging Method, we show that any graph with maximum degree A 1>8 that is embeddable in a surface 2~ of characteristic X(Z)>~0 is class one and any graph with maximum degree A>~9 that is embeddable in a surface Z of characteristic X(Z)=-1 is class one. For surfaces of