The Maximum Genus of a Graph with Given Diameter and Connectivity

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.