Dominating induced matchings in graphs without a skew star

We study the problem of determining whether a graph G has an induced matching that dominates every edge of the graph, which is also known as efficient edge domination. This problem is known to be NP-complete in general graphs, but it can be solved in polynomial time for graphs in some special classes, such as weakly chordal, P7-free or claw-free graphs. In the present paper we extend the polynomial-time solvability of the problem from claw-free graphs to graphs without a skew star, where a skew star is a tree with exactly three vertices of degree 1 being of distance 1,2,3 from the only vertex of degree 3.

[1]  M. Livingston,et al.  Distributing resources in hypercube computers , 1988, C3P.

[2]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.

[3]  Jan Kratochivíl,et al.  Regular codes in regular graphs are difficult , 1994 .

[4]  Charles Delorme,et al.  Efficient edge domination in regular graphs , 2008, Discret. Appl. Math..

[5]  Chuan Yi Tang,et al.  Solving the Weighted Efficient Edge Domination Problem on Bipartite Permutation Graphs , 1998, Discret. Appl. Math..

[6]  Paul D. Seymour,et al.  Claw-free graphs. V. Global structure , 2008, J. Comb. Theory, Ser. B.

[7]  Peter J. Slater,et al.  Efficient Edge Domination Problems in Graphs , 1993, Inf. Process. Lett..

[8]  Raffaele Mosca,et al.  On stable cutsets in claw-free graphs and planar graphs , 2005, J. Discrete Algorithms.

[9]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory B.

[10]  Chuan Yi Tang,et al.  Perfect edge domination and efficient edge domination in graphs , 2002, Discret. Appl. Math..

[11]  Vadim V. Lozin,et al.  Dominating Induced Matchings , 2009, Graph Theory, Computational Intelligence and Thought.

[12]  Nicholas Korpelainen,et al.  A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs , 2009, Electron. Notes Discret. Math..

[13]  Andreas Brandstädt,et al.  Efficient Edge Domination on Hole-Free Graphs in Polynomial Time , 2010, LATIN.

[14]  Martin Milanič,et al.  A polynomial algorithm to find an independent set of maximum weight in a fork-free graph , 2006, SODA '06.

[15]  Vadim V. Lozin,et al.  On the complexity of the dominating induced matching problem in hereditary classes of graphs , 2011, Discret. Appl. Math..

[16]  Dimitrios M. Thilikos,et al.  Treewidth for Graphs with Small Chordality , 1997, Discret. Appl. Math..

[17]  Odile Favaron.  Independence and upper irredundance in claw-free graphs , 2003, Discret. Appl. Math..

[18]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[19]  Andreas Brandstädt,et al.  Dominating Induced Matchings for P7-Free Graphs in Linear Time , 2011, Algorithmica.

[20]  Udi Rotics,et al.  On the Relationship Between Clique-Width and Treewidth , 2001, SIAM J. Comput..