Abstract A bipartite graph G=(A, B, E) G=(A, B, E) is H H-convex, for some family of graphs
HH, if there exists a graph H ∈ HH∈ H with V (H)= AV (H)= A such that the set of …

Abstract A subset M⊆ E of edges of a graph G=(V, E) is called a matching if no two edges of
M share a common vertex. An edge e∈ E is said to dominate itself and all other edges …

Abstract A bipartite graph G=(A, B, E) is H-convex for some family of graphs H if there exists
a graph H∈ H with V (H)= A such that the neighbours in A of each b∈ B induce a connected …

Let G be a connected graph having a perfect matching. The graph G is said to be induced
matching (IM) extendable if every induced matching M of G is contained in a perfect …

Abstract A bipartite graph G=(A, B, E) is H-convex, for some family of graphs H, if there exists
a graph H∈ H with V (H)= A such that the set of neighbours in A of each b∈ B induces a …

Given a graph G with a terminal set R⊆ V (G), the Steiner tree problem (STREE) asks for a
set S⊆ V (G)\R such that the graph induced on S∪ R is connected. A split graph is a graph …

Given a graph $ G $ with a terminal set $ R\subseteq V (G) $, the Steiner tree problem
(STREE) asks for a set $ S\subseteq V (G)\setminus R $ such that the graph induced on …

Let G be a connected graph having a perfect matching. The graph G is said to be induced
matching (IM) extendable if every induced matching M of G is contained in a perfect …

Abstract Let $ G=(V, E) $ be a finite undirected graph. An edge set $ E'\subseteq E $ is a
{\em dominating induced matching}({\em dim}) in $ G $ if every edge in $ E $ is intersected …

Abstract Let G=(V, E) be a finite undirected graph. An edge set E′⊆ E is a dominating
induced matching (dim) in G if every edge in E is intersected by exactly one edge of E′. The …