Perfect edge domination and efficient edge domination in graphs
Discrete Applied Mathematics
Acyclic domination on bipartite permutation graphs
Information Processing Letters
Note: Efficient edge domination in regular graphs
Discrete Applied Mathematics
Labeling bipartite permutation graphs with a condition at distance two
Discrete Applied Mathematics
Graph Theory, Computational Intelligence and Thought
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
A note on efficient domination in a superclass of P5-free graphs
Information Processing Letters
| Hi-index | 0.04 |