Sarah E. Anderson

collaborators

3 papers

math.CO2026

Characterizing all nonbipartite well-edge-dominated graphs

Sarah E. Anderson, Kirsti Kuenzel

Given a graph $G$ , a set $F$ of edges is an edge dominating set of $G$ if every edge in $G$ is either in $F$ or adjacent to an edge in $F$ . A graph $G$ 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…

math.CO2026

Characterizing all $K_{4}$ -free well-edge-dominated graphs of girth 3

Sarah E. Anderson, Kirsti Kuenzel

Given a graph $G$ , a set $F$ of edges is an edge dominating set if all edges in $G$ are either in $F$ or adjacent to an edge in $F$ . $G$ is said to be well-edge-dominated if every…

Characterizing all nonbipartite well-edge-dominated graphs

Census Dual Graphs: Properties and Random Graph Models

Characterizing all K4​-free well-edge-dominated graphs of girth 3

Characterizing all $K_{4}$ -free well-edge-dominated graphs of girth 3