1 citations · 1 across the 4 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.GT2026
Blindfolded pursuit with delays of your choice
Torben Schürenberg, Maximilian J. Stahlberg
We study pursuit-evasion games on graphs with a single pursuer and an invisible evader. The pursuer may assign integer travel times to the edges of the graph and specify a finite s…
math.CO2026
Hamilton paths and cycles in flip graphs of (almost-)perfect matchings
Sofia Brenner, Justin Dallant, Linda Kleist +3
We consider the set of matchings of a graph and a local change operation, called a flip, between them. In the combinatorial setting, the base graphs are either complete graphs or c…