scientific article; zbMATH DE number 3674114
From MaRDI portal
Publication:3870917
Cited in
(61)- \(k\)-tuple domination in graphs
- Vertex and edge covers with clustering properties: Complexity and algorithms
- Line domination in graphs
- On graphs with equal domination and independent domination numbers
- Linear algorithms on recursive representations of trees
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Edge domination in complete partite graphs
- Edge domatic numbers of complete \(n\)-partite graphs
- A 2-approximation algorithm for the minimum weight edge dominating set problem
- Perfect edge domination and efficient edge domination in graphs
- On independent \([1, 2]\)-sets in trees
- Integer programming formulations for the minimum weighted maximal matching problem
- An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
- The complexity of total edge domination and some related results on trees
- Complexity and characterization aspects of edge-related domination for graphs
- On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem
- Minimum maximal matchings in cubic graphs
- Approximation hardness of edge dominating set problems
- Roman edge semi-total block domination of a graph
- Approximability of the capacitated \(b\)-edge dominating set problem
- Generalizing the induced matching by edge capacity constraints
- Linear time algorithms for generalized edge dominating set problems
- On well-edge-dominated graphs
- 2-(edge-)connected edge domination number and matching number
- Fast and simple local algorithms for 2-edge dominating sets and 3-total vertex covers
- Decomposition algorithms for solving the minimum weight maximal matching problem
- On the algorithmic complexity of edge total domination
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
- scientific article; zbMATH DE number 6921365 (Why is no real title available?)
- Edge domination in some path and cycle related graphs
- A note on the edge Roman domination in trees
- Bounds on total edge domination number of a tree
- Edge domination and 2-independence in trees
- Edge domination number and the number of minimum edge dominating sets in pseudofractal scale-free web and Sierpiński gasket
- The edge-to-edge geodetic domination number of a graph
- Vertex-edge Roman domination
- RESTRAINED EDGE DOMINATION IN GRAPHS
- Edge domination in Boolean function graph \(\mathrm{B}(\overline{Kp}, \mathrm{L(G), NINC})\) of a graph
- On the domination number of a graph and its block graph
- On coefficients of edge domination polynomial of a graph
- RESTRAINED TOTAL EDGE DOMINATION IN THE JOIN OF GRAPHS
- PERFECT EDGE DOMINATION IN GRAPHS
- scientific article; zbMATH DE number 7527889 (Why is no real title available?)
- A note on an induced subgraph characterization of domination perfect graphs
- Edges contained in all or in no minimum edge dominating set of a tree
- Edge domination and total edge domination in the corona of graphs
- Rainbow edge domination numbers in graphs
- The algorithmic complexity of mixed domination in graphs
- Domination in distance-hereditary graphs
- Line-set domination in graphs
- Common domination perfect graphs
- Nordhaus-Gaddum-type results on the connected edge domination number
- EDGE ITALIAN DOMINATION OF SOME GRAPH PRODUCTS
- Edge domination on bipartite permutation graphs and cotriangulated graphs
- Dominating induced matchings and other graph parameters
- On domination cover edge pebbling number of generalized Petersen graph, jewel graph and triangular snake graph
- A note of 2-rainbow edge domination numbers of graphs
- On Camby-Plein's characterization of domination perfect graphs
- On domination and independent domination numbers of a graph
- Dominating sets for split and bipartite graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3870917)