Is there a name for the number of edges that need to be removed to lower the genus of a graph?

70 Views Asked by At

The number of edges that need to be removed from a graph to disconnect it is called the edge-connectivity. Similarly, given a graph of genus $n>0$, there is a minimum number of edges that you have to remove to obtain a graph of genus $n-1$. Is there a name for this number?