19 citations · 22 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2026
A dual view of Roman Domination: The 2-limited packing problem
Oliver Bachtler, Sven O. Krumke, Helena Weiß
We consider the 2-limited packing problem: for a graph one seeks to find a maximum cardinality subset , such that, for all , the closed neighbourhoo…
math.CO2022
Almost Disjoint Paths and Separating by Forbidden Pairs
Oliver Bachtler, Tim Bergner, Sven O. Krumke
By Menger's theorem the maximum number of arc-disjoint paths from a vertex s to a vertex t in a directed graph equals the minumum number of arcs needed to disconnect s and t, i.e.,…
math.CO2020★ 3 cited
Towards obtaining a 3-Decomposition from a perfect Matching
Oliver Bachtler, Sven O. Krumke
A decomposition of a graph is a set of subgraphs whose edges partition those of . The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected c…