The edge domination problem
From MaRDI portal
Recommendations
- Perfect edge domination: hard and solvable cases
- Edge domination in graphs
- scientific article; zbMATH DE number 7583650
- Exact algorithms for edge domination
- Exact Algorithms for Edge Domination
- Modelling and solving the perfect edge domination problem
- Edge domination in grids
- Dominating vertex covers: the vertex-edge domination problem
- The power edge set problem
- Boundary edge domination in graphs
Cited in
(16)- \(k\)-tuple domination in graphs
- Edge domination in complete partite graphs
- Perfect edge domination and efficient edge domination in graphs
- Integer programming formulations for the minimum weighted maximal matching problem
- Liar's domination in graphs: complexity and algorithm
- Modelling and solving the perfect edge domination problem
- Linear time algorithms for generalized edge dominating set problems
- On well-edge-dominated graphs
- Decomposition algorithms for solving the minimum weight maximal matching problem
- Hardness and approximation of minimum maximal matchings
- Mixed domination in undirected path graphs and block graphs
- Minimum edge blocker dominating set problem
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
- The power edge set problem
- Domination in distance-hereditary graphs
- Edge domination on bipartite permutation graphs and cotriangulated graphs
This page was built for publication: The edge domination problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4846685)
