1 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2026
Maker-Breaker games on infinite graphs with precolored edges
Nathan Bowler, Florian Gut, Henri Ortmüller
Suppose we are given graphs and . In the classical Maker-Breaker game two players, Maker and Breaker, alternately claim edges of and it is Maker's goal…
math.CO2023★ 1 cited
The -Game
Nathan Bowler, Florian Gut
We investigate a two player game called the -building game: two players alternately claim edges of an infinite complete graph. Each player's aim is to claim all six edges on s…
math.CO2023★ 1 cited
Decomposition of (infinite) digraphs along directed 1-separations
Nathan Bowler, Florian Gut, Meike Hatzel +3
We introduce torsoids, a canonical structure in matching covered graphs, corresponding to the bricks and braces of the graph. This allows a more fine-grained understanding of the s…