Dataset - CKAN

A single exponential bound for the redundant vertex Theorem on surfaces

Let s1 , t1 ,. . . sk , tk be vertices in a graph G embedded on a surface Σ of genus g. A vertex v of G is "redundant" if there exist k vertex disjoint paths linking...
- HTML

You can also access this registry using the API (see API Docs).