1 citations · 1 across the 4 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
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…
math.CO2024
On the Min-Max Star Partitioning Number
Sarah Feldmann, Torben Schürenberg
In this paper, we introduce a novel star partitioning problem for simple connected graphs . The goal is to find a partition of the edges into stars that minimizes the maxi…