Title of article
Constructing all minimum genus embeddings of
Author/Authors
Ellingham، نويسنده , , M.N. and Weaver، نويسنده , , Adam، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
6
From page
293
To page
298
Abstract
We show that all minimum genus embeddings of K 3 , n , orientable or nonorientable, can be constructed using simple operations based on adding one crosscap or one handle at a time.
Keywords
minimum genus embedding , Cubic graph , 3-edge-coloring , Complete bipartite graph
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2008
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454982
Link To Document