✦ LIBER ✦

On the genus of star graphs

✍ Scribed by Hoelzeman, D.A.; Bettayeb, S.

Book ID: 119772204
Publisher: IEEE
Year: 1994
Tongue: English
Weight: 473 KB
Volume: 43
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.286309

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the orientable genus of graphs with b

On the orientable genus of graphs with bounded nonorientable genus

✍ Bojan Mohar 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 396 KB

A conjecture of Robertson and Thomas on the orientable genus of graphs with a given nonorientable embedding is disproved.

On the genus and thickness of graphs

✍ Kouhei Asano 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 306 KB

On the maximum genus of a graph

✍ E.A Nordhaus; B.M Stewart; A.T White 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 415 KB

On the average genus of a graph

✍ Jonathan L. Gross; E. Ward Klein; Robert G. Rieper 📂 Article 📅 1993 🏛 Springer Japan 🌐 English ⚖ 535 KB

On the genus and connectivity of Hamilto

On the genus and connectivity of Hamiltonian graphs

✍ Richard A. Duke 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 675 KB

On the average genus of the random graph

✍ Saul Stahl 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 640 KB

## Abstract We obtain an upper bound on the expected number of regions in the randomly chosen orientable embedding of a fixed graph. This bound is ised to show that the average genus of the random graph on __v__ vertices is close to its maximum genus. More specifically, it is proven that the differ