𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum genus of regular graphs

✍ Scribed by M. Kotrbčík

Book ID
119236608
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
181 KB
Volume
38
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum genus and maximum nonseparating
Maximum genus and maximum nonseparating independent set of a 3-regular graph
✍ Yuangqiu Huang; Yanpei Liu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 440 KB

A set J C V is called a nonseparating independent set (nsis) of a connected graph G = (V, E), if J is an independent set of G, i.e., E A {uv [ Vu, v E J} = 0, and G -J is connected. We call z(G) = maxJ{lJ[ tJ is an nsis of G} the nsis number of G. Let G be a 3-regular connected graph; we prove that

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