𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


On the Connectivity of Graphs Embedded i
✍ Michael D Plummer; Xiaoya Zha πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 376 KB

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 Number of Acute Triangles in a St
✍ Atsushi Kaneko; Hiroshi Maehara; Mamoru Watanabe πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 80 KB

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

A list version of Dirac's theorem on the
✍ Alexandr V. Kostochka; Michael Stiebitz πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 110 KB πŸ‘ 2 views

## 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

On the density of 2-colorable 3-graphs i
✍ Klas MarkstrΓΆm; John Talbot πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 161 KB πŸ‘ 1 views

## 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}