Pages that link to "Item:Q3557057"
From MaRDI portal
The following pages link to Efficient Edge Domination on Hole-Free Graphs in Polynomial Time (Q3557057):
Displayed 22 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)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← 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)
- 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)
- 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)
- The Maximum Number of Dominating Induced Matchings (Q4982287) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- Dominating induced matching in some subclasses of bipartite graphs (Q5918091) (← links)
- Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time (Q6201338) (← links)