The edge domination problem

DOI10.7151/dmgt.1006zbMath0827.05030OpenAlexW2048299263MaRDI QIDQ4846685

Shiow-Fen Hwang, Gerard Jennhwa Chang

Publication date: 27 November 1995

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1006

zbMATH Keywords

linear time algorithmblock graphmixed edge dominating set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (13)

Perfect edge domination and efficient edge domination in graphs ⋮ Edge domination in complete partite graphs ⋮ Hardness and approximation of minimum maximal matchings ⋮ Modelling and solving the perfect edge domination problem ⋮ On well-edge-dominated graphs ⋮ Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs ⋮ Liar's domination in graphs: complexity and algorithm ⋮ Edge domination on bipartite permutation graphs and cotriangulated graphs ⋮ Integer programming formulations for the minimum weighted maximal matching problem ⋮ Linear time algorithms for generalized edge dominating set problems ⋮ Domination in distance-hereditary graphs ⋮ Decomposition algorithms for solving the minimum weight maximal matching problem ⋮ \(k\)-tuple domination in graphs

This page was built for publication: The edge domination problem