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…