2 papers
math.CO2026
Counting perfect edge dominating sets: extremal results and linear-time algorithms
Luciano N. Grippo, Min Chih Lin, Verónica Moyano +1
An edge of a graph \emph{dominates} itself and each edge adjacent to it. A \emph{perfect edge dominating set} is a subset of edges such that each edge outside the subset is dominat…
math.CO2026
Perfect Edge Domination in -free Graphs and in Graphs Without Efficient Edge Dominating Sets
Luciano N. Grippo, Min Chih Lin, Camilo Vera
An edge of a graph dominates itself along with any edge that shares an endpoint with it. An efficient edge dominating set (also called a dominating induced matching, DIM) is a subs…