A note on the maximum genus of 3-edge-connected nonsimple graphs |
| |
| Authors: | Huang Yuanqiu |
| |
| Affiliation: | (1) Dept. of Math., Human Normal Univ., 410081 Changsha |
| |
| Abstract: | ![]()
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) can be proved and this answers a question posed by Chen, et al. in 1996. Supported by NNSF of China (19801013). |
| |
| Keywords: | Maximum genus upper embeddable Betti defficiency. |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
|
