Efficient edge domination problems in graphs
From MaRDI portal
Recommendations
- Perfect edge domination and efficient edge domination in graphs
- scientific article; zbMATH DE number 4085682
- Efficient domination and efficient edge domination: a brief survey
- Efficient dominating and edge dominating sets for graphs and hypergraphs
- Efficient edge domination on hole-free graphs in polynomial time
Cites work
- scientific article; zbMATH DE number 3648727 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 4057564 (Why is no real title available?)
- scientific article; zbMATH DE number 4085682 (Why is no real title available?)
- scientific article; zbMATH DE number 4101265 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A recurrence template for several parameters in series-parallel graphs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Perfect codes in graphs
- Towards a theory of domination in graphs
Cited in
(47)- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
- THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS
- Perfect edge domination: hard and solvable cases
- Perfect edge domination and efficient edge domination in graphs
- Exact algorithms for dominating induced matching based on graph partition
- Dominating induced matching in some subclasses of bipartite graphs
- The efficiency of AC graphs
- Fast algorithms for some dominating induced matching problems
- Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time
- Solving the weighted efficient edge domination problem on bipartite permutation graphs
- Stable-\(\Pi\) partitions of graphs
- Some results on dominating induced matchings
- Efficient domination for classes of \(P_6\)-free graphs
- Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time
- Maximum \(k\)-regular induced subgraphs
- Efficient edge domination on hole-free graphs in polynomial time
- On the dominating induced matching problem: spectral results and sharp bounds
- On weighted efficient total domination
- Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time
- Efficient edge domination in regular graphs
- scientific article; zbMATH DE number 4057564 (Why is no real title available?)
- Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time
- Dominating induced matchings in graphs without a skew star
- Linear-time algorithm for paired-domination on distance-hereditary graphs
- Complexity and kernels for bipartition into degree-bounded induced graphs
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
- On the complexity of the dominating induced matching problem in hereditary classes of graphs
- An overview of \((\kappa, \tau)\)-regular sets and their applications
- Complexity and kernels for bipartition into degree-bounded induced graphs
- Efficient domination and efficient edge domination: a brief survey
- Modelling and solving the perfect edge domination problem
- Efficient dominating and edge dominating sets for graphs and hypergraphs
- Efficient domination through eigenvalues
- Kernelization of edge perfect code and its variants
- Efficient total domination in digraphs
- Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs
- Efficient domination in knights graphs
- Exact algorithms for minimum weighted dominating induced matching
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time
- scientific article; zbMATH DE number 5080622 (Why is no real title available?)
- Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs
- Independent feedback vertex set for \(P_5\)-free graphs
- Dominating induced matchings
- Dominating induced matchings for \(P_7\)-free graphs in linear time
- Graphs whose vertices of degree at least 2 lie in a triangle
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs
- The Maximum Number of Dominating Induced Matchings
This page was built for publication: Efficient edge domination problems in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313728)
