✦ LIBER ✦

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

✍ Scribed by Ren Han; Gao Yanbo

Publisher: Springer Japan
Year: 2010
Tongue: English
Weight: 244 KB
Volume: 27
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-0969-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum Genus of Strong Embeddings

✍ Er-ling Wei; Yan-pei Liu; Han Ren 📂 Article 📅 2003 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 190 KB

On the number of maximum genus embedding

On the number of maximum genus embeddings of almost all graphs

✍ Saul Stahl 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 642 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

The genus ofG-spaces and topological low

The genus ofG-spaces and topological lower bounds for chromatic numbers of hypergraphs

✍ A. Yu. Volovikov 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 180 KB

The maximum interval number of graphs wi

The maximum interval number of graphs with given genus

✍ Edward R. Scheinerman 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB 👁 1 views

The interval number of a graph G, denoted i(G), is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t compact real intervals. It is known that every planar graph has interval number at most 3 and that this result is best possible. We investiga