Prefer a chat interface with context about you and your work?
Dominating induced matchings in graphs containing no long claw
Abstract An induced matching M in a graph G is dominating if every edge not in M shares exactly one vertex with an edge in M . The dominating induced matching problem (also known as efficient edge domination ) asks whether a graph G contains a dominating induced matching. This …