๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by Li Deming; Liu Yanpei

Book ID
110624291
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
1999
Tongue
English
Weight
877 KB
Volume
15
Category
Article
ISSN
0168-9673

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 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