Pages that link to "Item:Q1005253"
From MaRDI portal
The following pages link to Efficient edge domination in regular graphs (Q1005253):
Displaying 15 items.
- Efficient domination through eigenvalues (Q317399) (← links)
- Combinatorial and spectral properties of König-Egerváry graphs (Q516875) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← 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)
- Perfect edge domination: hard and solvable cases (Q1639290) (← links)
- On the dominating induced matching problem: spectral results and sharp bounds (Q1686045) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Some results on dominating induced matchings (Q2117540) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Bounding and approximating minimum maximal matchings in regular graphs (Q2222947) (← links)
- Exact algorithms for dominating induced matching based on graph partition (Q2352792) (← links)
- Dominating induced matchings in graphs without a skew star (Q2447537) (← links)
- Dominating Induced Matchings (Q3655141) (← links)
- The Maximum Number of Dominating Induced Matchings (Q4982287) (← links)
