Pages that link to "Item:Q2839221"
From MaRDI portal
The following pages link to A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs (Q2839221):
Displayed 9 items.
- Combinatorial and spectral properties of König-Egerváry graphs (Q516875) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- On the dominating induced matching problem: spectral results and sharp bounds (Q1686045) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Dominating induced matchings in graphs without a skew star (Q2447537) (← links)
- The Maximum Number of Dominating Induced Matchings (Q4982287) (← links)
- Dominating induced matching in some subclasses of bipartite graphs (Q5918091) (← links)