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.
Let G be a 3 edge connected graph (possibly with multiple edges or loops), and let γ M(G) and β(G) be the maximum genus and the Betti number of G, respectively. Then γ M(G)≥β(G)/3 can be proved and this...Let G be a 3 edge connected graph (possibly with multiple edges or loops), and let γ M(G) and β(G) be the maximum genus and the Betti number of G, respectively. Then γ M(G)≥β(G)/3 can be proved and this answers a question posed by Chen, et al. in 1996.F FIRST OR展开更多
基金The NSF (10671073) of Chinathe Scientific Fund (03080045) of the Gathered Talents by Nantong UniversityNSF (07KJB110090) of Jiangsu University.
文摘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.
文摘Let G be a 3 edge connected graph (possibly with multiple edges or loops), and let γ M(G) and β(G) be the maximum genus and the Betti number of G, respectively. Then γ M(G)≥β(G)/3 can be proved and this answers a question posed by Chen, et al. in 1996.F FIRST OR
