The following pages link to The edge domination problem (Q4846685):
Displaying 15 items.
- Minimum edge blocker dominating set problem (Q319914) (← links)
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
- \(k\)-tuple domination in graphs (Q1014390) (← links)
- Edge domination in complete partite graphs (Q1336647) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Integer programming formulations for the minimum weighted maximal matching problem (Q1758060) (← links)
- Liar's domination in graphs: complexity and algorithm (Q1949115) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Linear time algorithms for generalized edge dominating set problems (Q2480902) (← links)
- On well-edge-dominated graphs (Q2673496) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- Hardness and approximation of minimum maximal matchings (Q2935383) (← links)
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs (Q3502661) (← links)
- The power edge set problem (Q4642407) (← links)
- Domination in distance-hereditary graphs (Q5957300) (← links)