𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum Genus of Strong Embeddings

✍ Scribed by Er-ling Wei; Yan-pei Liu; Han Ren

Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2003
Tongue
English
Weight
190 KB
Volume
19
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs of given genus and arbitrarily la
Graphs of given genus and arbitrarily large maximum genus
✍ Richard D. Ringeisen πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 540 KB

Abstrart. The maximum genus of a connected graph (: is the maximum among the genera of a!1 cornpact olientable 2-manifolds upon which G has 2-&l embeddings. In the theorems that fc-llow the use of an edg;:-adding techniq se is combined with ihe well-known Edmonds' technique to prfiruce the desired r

Maximum genus and girth of graphs
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

The maximum genus of vertex-transitive g
The maximum genus of vertex-transitive graphs
✍ 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