✦ LIBER ✦

Lower bounds on the maximum genus of loopless multigraphs

✍ Scribed by Li Deming; Liu Yanpei

Book ID: 107500428
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 2000
Tongue: English
Weight: 537 KB
Volume: 15
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-000-0031-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tight lower bound on the maximum genus

A tight lower bound on the maximum genus of a 3-connected loopless multigraph

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

A tight lower bound on the maximum genus

A tight lower bound on the maximum genus of 3-edge connected loopless graphs

✍ Li Deming; Liu Yanpei 📂 Article 📅 1999 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 877 KB

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

Lower Bound of the Number of Maximum Gen

Lower Bound of the Number of Maximum Genus Embeddings and Genus Embeddings ofK12s+7

✍ Ren Han; Gao Yanbo 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 244 KB

Remarks on the lower bounds for the aver

Remarks on the lower bounds for the average genus

✍ Yi-chao Chen 📂 Article 📅 2011 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 230 KB

On the maximum matchings of regular mult

On the maximum matchings of regular multigraphs

✍ Takao Nishizeki 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 793 KB