摘要
In this paper, we first review some of the known results about the maximum genus of a graph with given diameter or (and) connectivity. Then we prove that a 3-connected diameter 4 multigraph has Betti deficiency at most 2. Furthermore, we show this upper bound is sharp.
| 原文 | English |
|---|---|
| 頁（從 - 到） | 330-337 |
| 頁數 | 8 |
| 期刊 | Electronic Notes in Discrete Mathematics |
| 卷 | 11 |
| DOIs | |
| 出版狀態 | Published - 1 七月 2002 |