𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Results of the maximum genus of graphs

✍ Scribed by Guang-hua Dong; Yan-pei Liu


Book ID
107347568
Publisher
SP Science China Press
Year
2007
Tongue
English
Weight
197 KB
Volume
50
Category
Article
ISSN
1674-7283

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Survey of results on the maximum genus o
✍ Richard D. Ringeisen πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 619 KB

## Abstract Some of the early questions concerning the maximum genus of a graph have now been answered. In this paper we survey the progress made on such problems and present some recent results, outlining proofs for some of the major theorems.

Maximum genus of regular graphs
✍ M. Kotrbčík πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 181 KB
The maximum genus of vertex-transitive g
✍ Martin Ε koviera; Roman Nedela πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 911 KB

The maximum genus of all vertex-transitive graphs is computed. It is proved that a k-valent vertex-transitive graph of girth g is upper-embeddable whenever k 3 4 or g 2 4. Non-upper-embeddable vertex-transitive graphs are characterized. A particular attention is paid to Cayley graphs. Groups for wh

Maximum genus and girth of graphs
✍ Yuangqiu Huang πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 302 KB

In this paper, a lower bound on the maximum genus of a graph in terms of its girth is established as follows: let G be a simple graph with minimum degree at least three, and let g be the girth of G. Then ?M(G)~> ~fl(G) + 1 except for G=K4, g-1 where ]~(G) denotes the cycle rank of G and K4 is the co

On the maximum genus of a graph
✍ E.A Nordhaus; B.M Stewart; A.T White πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 415 KB