𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A relative maximum genus graph embedding and its local maximum genus

✍ Scribed by Li Deming; Liu Yanpei

Book ID
110611767
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2000
Tongue
English
Weight
502 KB
Volume
16
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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

On the maximum genus of a graph
On the maximum genus of a graph
✍ E.A Nordhaus; B.M Stewart; A.T White πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 415 KB
Maximum genus and chromatic number of gr
Maximum genus and chromatic number of graphs
✍ Yuanqiu Huang πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 157 KB

Let T be a spanning tree of a connected graph G. Denote by (G; T ) the number of components in G\E(T ) with odd number of edges. The value minT (G; T ) is known as the Betti deΓΏciency of G, denoted by (G), where the minimum is taken over all spanning trees T of G. It is known (N.H. Xuong, J. Combin.