10 citations · 19 across the 18 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
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…
cs.DM2014★ 1 cited
Counting K_4-Subdivisions
Tillmann Miltzow, Jens M. Schmidt, Mingji Xia
A fundamental theorem in graph theory states that any 3-connected graph contains a subdivision of . As a generalization, we ask for the minimum number of -subdivisions th…