Showing 2026Show all
2 papers · 1 filter
math.CO2026
Characterizing all nonbipartite well-edge-dominated graphs
Sarah E. Anderson, Kirsti Kuenzel
Given a graph , a set of edges is an edge dominating set of if every edge in is either in or adjacent to an edge in . A graph is said to be well-edge-domi…
cs.DM2026
Census Dual Graphs: Properties and Random Graph Models
Sara Anderson, Sarah Cannon, Brooke Feinberg +1
In the computational study of political redistricting, feasibility necessitates the use of a discretization of regions such as states, counties, and towns. In nearly all cases, res…