Finding Efficient Domination for (S_1,2,5,S_3,3,3-Free Chordal Bipartite Graphs in Polynomial Time
share
A vertex set D in a finite undirected graph G is an efficient dominating set (e.d.s. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d.s. in G, is known to be -complete for chordal bipartite graphs as well as for P_7-free graphs, and even for very restricted H-free bipartite graph classes such as for K_1,4-free bipartite graphs as well as for C_4-free bipartite graphs while it is solvable in polynomial time for P_8-free bipartite graphs as well as for S_1,3,3-free bipartite graphs and for S_1,1,5-free bipartite graphs. Here we show that ED can be solved in polynomial time for (S_1,2,5,S_3,3,3)-free chordal bipartite graphs.
READ FULL TEXT
