✦ LIBER ✦

The maximum genus of a 3-regular simplicial graph

✍ Scribed by Li Deming; Liu Yanpei

Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 1999
Tongue: English
Weight: 601 KB
Volume: 14
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-999-0027-9

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

A tight lower bound on the maximum genus

A tight lower bound on the maximum genus of a simplicial graph

✍ Jianer Chen; Saroja P. Kanchi; Jonathan L. Gross 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 856 KB

It is proved that every connected simplicial graph with minimum valence at least three has maximum genus at least one-quarter of its cycle rank. This follows from the technical result that every 3-regular simplicial graph except K4 has a Xuong co-tree whose odd components have only one edge each. It

The Maximum Genus on a 3-Vertex-Connecte

The Maximum Genus on a 3-Vertex-Connected Graph

✍ Yuangqiu Huang 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 104 KB

The Relative Maximum Genus of a Graph

✍ C.P. Bonnington 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 422 KB

On the maximum genus of a graph

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

How to determine the maximum genus of a

How to determine the maximum genus of a graph

✍ Nguyen Huy Xuong 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 477 KB