Pages that link to "Item:Q2352792"
From MaRDI portal
The following pages link to Exact algorithms for dominating induced matching based on graph partition (Q2352792):
Displaying 6 items.
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- Perfect edge domination: hard and solvable cases (Q1639290) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Graphs whose vertices of degree at least 2 lie in a triangle (Q6667338) (← links)
