Exponentially many maximum genus embeddings and genus embeddings for complete graphs
type: Item
instance of: scholarly article
title: Exponentially many maximum genus embeddings and genus embeddings for complete graphs
zbMATH Open document ID: 1182.05044
author: Han Ren
author: Yun Bai
published in: Science in China. Series A
publication date: 2009-12-07T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 5643345
zbMATH Keywords: maximum genus
zbMATH Keywords: embeddings
zbMATH Keywords: complete graph
MaRDI profile type: Publication
full work available at URL: s11425-007-0194-1
OpenAlex ID: W2087944085
cites work: Q3899969
cites work: A new characterization of the maximum genus of a graph
cites work: How to determine the maximum genus of a graph
cites work: Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
cites work: Q4773723
cites work: A sequence representation for maps
cites work: An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus
cites work: Uniqueness and faithfulness of embedding of toroidal graphs
cites work: Three nonisomorphic triangulations of an orientable surface with the same complete graph
cites work: Face 2-colourable triangular embeddings of complete graphs
cites work: Exponential families of non-isomorphic triangulations of complete graphs
cites work: On the number of nonisomorphic orientable regular embeddings of complete graphs
cites work: Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
DOI: 10.1007/S11425-007-0194-1
description: scientific article; zbMATH DE number 5643345