Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 322-329 |
Number of pages | 8 |
Journal | Electronic Notes in Discrete Mathematics |
Volume | 11 |
DOIs | |
State | Published - 1 Jul 2002 |
Keywords
- Betti deficiency
- Maximum genus
- diameter and connectivity