✦ LIBER ✦

The Maximum Genus on a 3-Vertex-Connected Graph

✍ Scribed by Yuangqiu Huang

Publisher: Springer Japan
Year: 2000
Tongue: English
Weight: 104 KB
Volume: 16
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730070022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A note on the maximum genus of 3-edge-co

A note on the maximum genus of 3-edge-connected nonsimple graphs

✍ Huang Yuanqiu 📂 Article 📅 2000 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 229 KB

On the maximum genus of a graph

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

The maximum genus of a 3-regular simplic

The maximum genus of a 3-regular simplicial graph

✍ Li Deming; Liu Yanpei 📂 Article 📅 1999 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 601 KB

The Maximum Genus of a Graph with Given

The Maximum Genus of a Graph with Given Diameter and Connectivity

✍ Hung-Lin Fu; Ming-Chun Tsai 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 354 KB

The Relative Maximum Genus of a Graph

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