Pages that link to "Item:Q1613347"
From MaRDI portal
The following pages link to Perfect edge domination and efficient edge domination in graphs (Q1613347):
Displaying 11 items.
- Efficient domination through eigenvalues (Q317399) (← links)
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Efficient and perfect domination on circular-arc graphs (Q324824) (← links)
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← 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)
- Complexity of simplicial homology and independence complexes of chordal graphs (Q679745) (← links)
- On the complexity of the dominating induced matching problem in hereditary classes of graphs (Q716179) (← links)
- Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time (Q777392) (← links)
- Efficient edge domination in regular graphs (Q1005253) (← links)
- Perfect edge domination: hard and solvable cases (Q1639290) (← links)
