Jens M. Schmidt

activity

20092021

most citedCertifying 3-Edge-Connectivity

10 citations · 19 across the 18 of their papers we have counts for

collaborators

Showing 2016Show all

4 papers · 1 filter

math.CO2016

More on foxes

Matthias Kriesell, Jens M. Schmidt

An edge in a $k$ -connected graph $G$ is called {\em $k$ -contractible} if the graph $G / e$ obtained from $G$ by contracting $e$ is $k$ -connected. Generalizing earlier results on $3$ -…

cs.DM2016

Computing Vertex-Disjoint Paths using MAOs

Johanna E. Preißer, Jens M. Schmidt

Let G be a graph with minimum degree $δ$ . It is well-known that maximal adjacency orderings (MAOs) compute a vertex set S such that every pair of S is connected by at least $δ$ int…

cs.DM2016

Edge-Orders

Lena Schlipf, Jens M. Schmidt

Canonical orderings and their relatives such as st-numberings have been used as a key tool in algorithmic graph theory for the last decades. Recently, a unifying concept behind all…

math.CO2016

A Tight Bound for Minimal Connectivity

Jens M. Schmidt

For minimally $k$ -connected graphs on $n$ vertices, Mader proved a tight lower bound for the number $∣ V_{k} ∣$ of vertices of degree $k$ in dependence on $n$ and $k$ . Oxley observed 1…