arXiv Analytics

Sign in

arXiv:1004.4484 [cs.DM]AbstractReferencesReviewsResources

Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus

Viresh Patel

Published 2010-04-26Version 1

In this paper, we show that for an $n$-vertex graph $G$ of genus $g$, the edge expansion of $G$ can be determined in time $n^{O(g^2)}$. We show that the same is true for various other similar measures of edge connectivity.

Related articles:
arXiv:1908.06300 [cs.DM] (Published 2019-08-17)
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
arXiv:1806.00541 [cs.DM] (Published 2018-06-01)
Extension Complexity of the Correlation Polytope
arXiv:1904.07216 [cs.DM] (Published 2019-04-15)
A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus