| 无环多重图的最大亏格的下界 |
| |
| 引用本文： | LiDeming LiuYanpei. 无环多重图的最大亏格的下界[J]. 高校应用数学学报(英文版), 2000, 15(4): 359-368. DOI: 10.1007/s11766-000-0031-6 |
| |
| 作者姓名： | LiDeming LiuYanpei |
| |
| 作者单位： | [1]Dept.ofMath.,CapitalNormalUniv.,Beijing100037 [2]Dept.ofMath.,NorthernJiaotongUniv.,Beijing100044 |
| |
| 摘 要： | 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.
|
| 关 键 词： | 极限亏格 下界 环绕重图 连通性 |
| 收稿时间： | 1999-01-25 |
Lower bounds on the maximum genus of loopless multigraphs |
| |
| Li Deming,Liu Yanpei. Lower bounds on the maximum genus of loopless multigraphs[J]. Applied Mathematics A Journal of Chinese Universities, 2000, 15(4): 359-368. DOI: 10.1007/s11766-000-0031-6 |
| |
| Authors: | Li Deming Liu Yanpei |
| |
| Affiliation: | Dept.of Math., Capital Normal Univ., Beijing 100037;Dept.Of Math., Northern Jiaotong Univ., Beijing 100044 |
| |
| Abstract: | 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. |
| |
| Keywords: | 05C10 |
| 本文献已被 维普 万方数据 SpringerLink 等数据库收录！ |
|
