Dominating Induced Matchings

Authors:
Domingos M. Cardoso;Vadim V. Lozin
Affiliations:
Departamento de Matemática da Universidade de Aveiro, Aveiro, Portugal 3810-193;DIMAP and Mathematics Institute, University of Warwick, Coventry, UK CV4 7AL
Venue:
Graph Theory, Computational Intelligence and Thought
Year:
2009

Citing 7
Cited 3

Efficient edge domination problems in graphs

Information Processing Letters
Regular codes in regular graphs are difficult

Discrete Mathematics
Solving the weighted efficient edge domination problem on bipartite permutation graphs

Discrete Applied Mathematics
New results on induced matchings

Discrete Applied Mathematics
Perfect edge domination and efficient edge domination in graphs

Discrete Applied Mathematics
Note: The induced matching and chain subgraph cover problems for convex bipartite graphs

Theoretical Computer Science
Note: Efficient edge domination in regular graphs

Discrete Applied Mathematics

On the complexity of the dominating induced matching problem in hereditary classes of graphs

Discrete Applied Mathematics
Efficient edge domination on hole-free graphs in polynomial time

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Dominating induced matchings for p

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of determining whether or not 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 as well as in some restricted domains, such as bipartite graphs or regular graphs. In this paper, we identify a graph parameter to which the complexity of the problem is sensible and produce results of both negative (intractable) and positive (solvable in polynomial time) type.