LOWER BOUNDS ON THE MAXIMUM GENUS OF LOOPLESS MULTIGRAPHS  

作　　者：LiDeming LiuYanpei 

机构地区：[1]Dept.ofMath.,CapitalNormalUniv.,Beijing100037 [2]Dept.ofMath.,NorthernJiaotongUniv.,Beijing100044

出　　处：《Applied Mathematics(A Journal of Chinese Universities)》2000年第4期359-368,共10页高校应用数学学报（英文版）（B辑）

摘　　要：The lower bounds on the maximum genus of loopless graphs are obtained according to the connectivity of these graphs. This not only answers a question of Chen, Archdeacon and Gross, but also generalizes the previous known results. Thus, a picture of the lower bounds on the maximum genus of loopless multigraphs is presented.The lower bounds on the maximum genus of loopless graphs are obtained according to the connectivity of these graphs. This not only answers a question of Chen, Archdeacon and Gross, but also generalizes the previous known results. Thus, a picture of the lower bounds on the maximum genus of loopless multigraphs is presented.

关 键 词：Maximum genus lower bound multigraph. 

分 类 号：O157.5[理学—数学]