Well-edge-dominated graphs containing triangles

Jake Berg, Perryn Chang, Claire Kaneshiro +4

A set of edges $F$ in a graph $G$ is an edge dominating set if every edge in $G$ is either in $F$ or shares a vertex with an edge in $F$. $G$ is said to be well-edge-dominated if a…