Finding Dominating Induced Matchings in P_9-Free Graphs in Polynomial Time

08/02/2019
by   Andreas Brandstädt, et al.
0

Let G=(V,E) be a finite undirected graph. An edge set E' ⊆ E is a dominating induced matching ( d.i.m.) in G if every edge in E is intersected by exactly one edge of E'. The Dominating Induced Matching (DIM) problem asks for the existence of a d.i.m. in G; this problem is also known as the Efficient Edge Domination problem; it is the Efficient Domination problem for line graphs. The DIM problem is -complete even for very restricted graph classes such as planar bipartite graphs with maximum degree 3 but is solvable in linear time for P_7-free graphs, and in polynomial time for S_1,2,4-free graphs as well as for S_2,2,2-free graphs and for S_2,2,3-free graphs. In this paper, combining two distinct approaches, we solve it in polynomial time for P_9-free graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/14/2019

Finding Dominating Induced Matchings in S_1,1,5-Free Graphs in Polynomial Time

Let G=(V,E) be a finite undirected graph. An edge set E' ⊆ E is a domin...
research
01/05/2021

Finding Efficient Domination for P_8-Free Bipartite Graphs in Polynomial Time

A vertex set D in a finite undirected graph G is an efficient dominating...
research
04/25/2022

Some New Results on Efficient and Perfect Edge Domination of Graphs

A neighborhood star-free graph is one in which every vertex of degree at...
research
12/01/2019

Some Results on Dominating Induced Matchings

Let G be a graph, a dominating induced matching (DIM) of G is an induced...
research
04/25/2023

A note on local search for hitting sets

Let π be a property of pairs (G,Z), where G is a graph and Z⊆ V(G). In t...
research
05/13/2019

Maximum Weighted Matching with Few Edge Crossings for 2-Layered Bipartite Graph

Let c denote a non-negative constant. Suppose that we are given an edge-...
research
07/07/2021

Budgeted Dominating Sets in Uncertain Graphs

We study the Budgeted Dominating Set (BDS) problem on uncertain graphs, ...

Please sign up or login with your details

Forgot password? Click here to reset