73 citations · 178 across the 49 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.CO2026
Strong coloring numbers of grids
Piotr Micek, Torsten Ueckerdt
For positive integers and , the -dimensional grid of side length is the graph with vertex set , in which two vertices are adjacent if they differ by $…
cs.CG2026
Rerouting Curves on Surfaces
Timo Brand, Stefan Felsner, Henry Förster +8
We study the problem of reconfiguring a crossing-free embedding of a graph on a surface, with edges represented as curves, into another crossing-free embedding of the same graph on…
cs.CG2026
Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
Håvard Bakke Bjerkevik, Joseph Dorfer, Linda Kleist +2
We consider the problem of reconfiguring non-crossing spanning trees on point sets. For a set of points in general position in the plane, the flip graph has a vertex…