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 32 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)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- Fast algorithms for some dominating induced matching problems (Q2015144) (← links)
- Efficient domination for classes of \(P_6\)-free graphs (Q2030432) (← links)
- Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time (Q2158196) (← links)
- Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs (Q2174557) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time (Q2192098) (← links)
- Exact algorithms for dominating induced matching based on graph partition (Q2352792) (← links)
- Dominating induced matchings in graphs without a skew star (Q2447537) (← links)
- Minimum 2-tuple dominating set of permutation graphs (Q2511387) (← links)
- Maximal matching and edge domination in complete multipartite graphs (Q2921894) (← links)
- Dominating Induced Matchings (Q3655141) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- The Maximum Number of Dominating Induced Matchings (Q4982287) (← links)
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
- Maximal matchings in polyspiro and benzenoid chains (Q5028845) (← links)
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs (Q5864729) (← links)
- Dominating induced matching in some subclasses of bipartite graphs (Q5918091) (← links)
- Extended formulations for perfect domination problems and their algorithmic implications (Q6113358) (← links)
- Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time (Q6201338) (← links)
- Graphs whose vertices of degree at least 2 lie in a triangle (Q6667338) (← links)
