| Results of the maximum genus of graphs |
| |
| 作者姓名： | Guang-hua DONG~ Yan-pei LIU |
| |
| 作者单位： | Guang-hua DONG~ Yan-pei LIU Department of Mathematics，School of Science，Beijing Jiaotong University，Beijing 100044，China |
| |
| 摘 要： | In this paper,we provide a new class of up-embeddable graphs,and obtain a tight lower bound on the maximum genus of a class of 2-connected pseudographs of diameter 2 and of a class of diameter 4 multi-graphs.This extends a result of Skoviera.
|
Results of the maximum genus of graphs |
| |
| Guang-hua DONG,Yan-pei LIU.Results of the maximum genus of graphs[J].Science in China(Mathematics),2007,50(11):1563-1570. |
| |
| Authors: | Guang-hua Dong Yan-pei Liu |
| |
| Institution: | Department of Mathematics,School of Science,Beijing Jiaotong University,Beijing 100044,China |
| |
| Abstract: | In this paper,we provide a new class of up-embeddable graphs,and obtain a tight lower bound on the maximum genus of a class of 2-connected pseudographs of diameter 2 and of a class of diameter 4 multi-graphs.This extends a result of Skoviera. |
| |
| Keywords: | maximum genus up-embeddable diameter |
| 本文献已被 CNKI 万方数据 SpringerLink 等数据库收录！ |
