journal6 ›› 2011, Vol. 32 ›› Issue (4): 4-7.

• Mathematics • Previous Articles     Next Articles

Upper Embeddablity of Graphs and 2-Factor


  1. (1.Department of Mathematics Science and Computer Technology,Central South University,Changsha 410083,China;2.Department of Applied Mathematics,Guangdong University of Technology,Guangzhou 510006,China)
  • Online:2011-07-25 Published:2012-04-07
  • About author:LIU Duan-feng(1976-),female,was born in Dongkou,Shaoyang,Hunan,Lecturer,Ph.D candiadates,research area are graph theory and its applications.
  • Supported by:

    Supported by Youth Funding the Project of Guangdong University of Technology(062060)

Abstract: This paper discusses the upper embeddablity of some 3-connected  or k-regular graphs with 4-polygon  2-factor,and obtains some classes of upper embeddable graphs.

Key words: 2-factor, maximum genus, upper embeddable

WeChat e-book chaoxing Mobile QQ