✦ LIBER ✦

Exponentially many maximum genus embeddings and genus embeddings for complete graphs

✍ Scribed by Han Ren; Yun Bai

Book ID: 107347690
Publisher: SP Science China Press
Year: 2008
Tongue: English
Weight: 277 KB
Volume: 51
Category: Article
ISSN: 1674-7283
DOI: 10.1007/s11425-007-0194-1

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

A relative maximum genus graph embedding

A relative maximum genus graph embedding and its local maximum genus

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

Exponential families of nonisomorphic no

Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs

✍ Vladimir P. Korzhik; Heinz-Jürgen Voss 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 582 KB

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

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

Exponential Families of Non-isomorphic N

Exponential Families of Non-isomorphic Non-triangular Orientable Genus Embeddings of Complete Graphs

✍ Vladimir P. Korzhik; Heinz-Jurgen Voss 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 421 KB

It is shown that for every i 2 f1; 2; . . . ; 11g=f3; 4; 7g the complete graph K 12sþi for s5dðiÞ 2 f1; 2; 3; 4g has at least hðiÞ4 s non-isomorphic orientable genus embeddings, where hðiÞ 2 1; 1 2 ; 1 4 ; 1 8