On the Connectivity of Graphs Embedded in Surfaces II

Abstract

Let κmax(Σ) denote the maximum value for the connectivity of any graph which embeds in the topological surface Σ. The connectivity interval for Σ is the set of integers in the interval [1, κmax(Σ)]. Given an integer i in [1, κmax(Σ)] it is a trivial problem to demonstrate that there is a graph Gi with connectivity i which also embeds in Σ. We will say that… (More)

5 Figures and Tables

Topics

  • Presentations referencing similar topics