Title of article
Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
Author/Authors
Korzhik، نويسنده , , Vladimir P. and Voss، نويسنده , , Heinz-Jürgen، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
35
From page
253
To page
287
Abstract
It is shown that there are constants M and c such that for n⩾M the number of nonisomorphic nonorientable genus embeddings of the complete graph Kn is at least c2n/6.
Keywords
Nonisomorphic embeddings , Complete Graph , Genus embedding , Topological embedding
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2004
Journal title
Journal of Combinatorial Theory Series B
Record number
1527451
Link To Document