东北数学（英文版）
東北數學（英文版）
동북수학（영문판）
NORTHEASTERN MATHEMATICAL JOURNAL
2008年
3期
189-195
,共7页
generalized permutation graph%maximum genus%upper embeddable
In this paper we prove that the generalized permutation graph G(n, k) is upper embeddable if it has at most two odd subcycles, and that the maximum genus of G(n,k) is more than [β(G(n,k))/3] in most cases.
