Lower Bounds for the Average Genus of a CF-graph
Abstract
CF-graphs form a class of multigraphs that contains all simple graphs. We prove a lower bound for the average genus of a CF-graph which is a linear function of its Betti number. A lower bound for average genus in terms of the maximum genus and some structure theorems for graphs with a given average genus are also provided.
Published
2010-11-05
How to Cite
Chen, Y. (2010). Lower Bounds for the Average Genus of a CF-graph. The Electronic Journal of Combinatorics, 17(1), R150. https://doi.org/10.37236/422
Issue
Article Number
R150