𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Kuratowski-Type Theorems for Average Genus

✍ Scribed by J. Chen; J.L. Gross

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
767 KB
Volume
57
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

✦ Synopsis

Graphs of small average genus are characterized. In particular, a Kuratowskitype theorem is obtained: except for finitely many graphs, a cutedge-free graph has average genus less than or equal to (t) if and only if it is a necklace. We provide a complete list of those exceptions. A Kuratowski-type theorem for graphs of maximum genus 1 is also given. Some of the methods used in obtaining these results involve variations of a classical result of Whitney. 1993 Academic Press. Inc.

πŸ“œ SIMILAR VOLUMES

A Kuratowski Theorem for some Pseudosurf
A Kuratowski Theorem for some Pseudosurfaces
✍ L. Boza; M.T. DΓ‘vila; E.M. Fedriani; R. Moyano πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 256 KB
Lower bounds for the average genus
Lower bounds for the average genus
✍ Jianer Chen; Jonathan L. Gross; Robert G. Rieper πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 705 KB

Two lower bounds are obtained for the average genus of graphs. The average genus for a graph of maximum valence at most 3 is at least half its maximum genus, and the average genus for a 2-connected simplicial graph other than a cycle is at least 1/16 of its cycle rank.

Structure for a graph with average genus
Structure for a graph with average genus
✍ Yichao Chen; Yanpei Liu; Rongxia Hao πŸ“‚ Article πŸ“… 2006 πŸ› Springer-Verlag 🌐 English βš– 222 KB