New polynomial case for efficient domination in $P_6$-free graphs

TL;DR

This paper demonstrates that the Efficient Dominating Set problem, previously unresolved for P6-free graphs, can be efficiently solved within a specific subclass of these graphs, expanding the understanding of its computational complexity.

Contribution

The paper introduces a polynomial-time algorithm for the EDS problem in the subclass of (P6, banner)-free graphs, filling a gap in complexity classification.

Findings

Efficient algorithm for (P6, banner)-free graphs

Polynomial-time solvability of EDS in this subclass

Advances understanding of EDS complexity in P6-free graphs

Abstract

In a graph $G$, an {\it efficient dominating set} is a subset $D$ of vertices such that $D$ is an independent set and each vertex outside $D$ has exactly one neighbor in $D$. The {\textsc{Efficient Dominating Set}} problem (EDS) asks for the existence of an efficient dominating set in a given graph $G$. The EDS is known to be $NP$-complete for $P_7$-free graphs, and is known to be polynomial time solvable for $P_5$-free graphs. However, the computational complexity of the EDS problem is unknown for $P_6$-free graphs. In this paper, we show that the EDS problem can be solved in polynomial time for a subclass of $P_6$-free graphs, namely ($P_6$, banner)-free graphs.