Pages that link to "Item:Q716179"
From MaRDI portal
The following pages link to On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179):
Displaying 11 items.
- Efficient domination through eigenvalues (Q317399) (← links)
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
- Combinatorial and spectral properties of König-Egerváry graphs (Q516875) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time (Q524382) (← links)
- Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time (Q777392) (← links)
- Perfect edge domination: hard and solvable cases (Q1639290) (← links)
- On the dominating induced matching problem: spectral results and sharp bounds (Q1686045) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- Dominating induced matching in some subclasses of bipartite graphs (Q5918091) (← links)
