3 papers
math.CO2026
Separating Geodesic Structure and Product Structure
Laura Merker, Lena Scherzer, Samuel Schneider
The geodesic treewidth of a graph is the smallest for which there is a partition into geodesics such that has treewidth , where $G/\mathc…
math.CO2025
Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
Samuel Schneider, Torsten Ueckerdt
Chernyshev, Rauch and Rautenbach [Discrete Math., 2025] introduce forest cuts, i.e., vertex separators that induce a forest. They conjecture that, similar to a result by Chen and Y…
math.CO2024
Cops and Robber -- When Capturing is not Surrounding
Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt
We consider "surrounding" versions of the classic Cops and Robber game. The game is played on a connected graph in which two players, one controlling a number of cops and the other…