The Maximum Genus of a Graph with Given Diameter and Connectivity

Hung-Lin Fu*, Ming Chun Tsai

*Corresponding author for this work

研究成果: Article同行評審

摘要

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

指紋 深入研究「The Maximum Genus of a Graph with Given Diameter and Connectivity」主題。共同形成了獨特的指紋。

引用此