In a 1973 paper, Cooke obtained an upper bound on the possible connectivity of a graph embedded in a surface (orientable or nonorientable) of fixed genus. Furthermore, he claimed that for each orientable genus #>0 (respectively, nonorientable genus #Γ >0, #Γ {2) there is a complete graph of orientab
On the Edge Reconstruction of Graphs Embedded in Surfaces, III
β Scribed by Yue Zhao
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 239 KB
- Volume
- 74
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we show that any maximal planar graph with m triangles except the unbounded face can be transformed into a straight-line embedding in which at least WmΓ3X triangles are acute triangles. Moreover, we show that any maximal outerplanar graph can be transformed into a straight-line embeddi
## Abstract One of the basic results in graph colouring is Brooks' theorem [R. L. Brooks, Proc Cambridge Phil Soc 37 (1941) 194β197], which asserts that the chromatic number of every connected graph, that is not a complete graph or an odd cycle, does not exceed its maximum degree. As an extension o
## Abstract Let __ex__~2~(__n, K__) be the maximum number of edges in a 2βcolorable __K__βfree 3βgraph (where __K__={123, 124, 134} ). The 2βchromatic TurΓ‘n density of __K__ is \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$\pi\_{2}({K}\_{4}^-) =lim\_{{n}\to \infty} {ex}\_{2}