Edge Dominating Sets in Graphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Improved approximation bounds for edge dominating set in dense graphs
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs
- \(k\)-tuple domination in graphs
- On two techniques of combining branching and treewidth
- Concerning the achromatic number of graphs
- Minimum-maximal matching in series-parallel graphs
- Random edge domination
- The b-chromatic number of a graph
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
- Edge domination in complete partite graphs
- Edge domatic numbers of complete \(n\)-partite graphs
- Restrictions of minimum spanner problems
- Small maximal matchings in random graphs.
- On linear and circular structure of (claw, net)-free graphs
- A 2-approximation algorithm for the minimum weight edge dominating set problem
- On approximability of the independent/connected edge dominating set problems
- Hard variants of stable marriage.
- Perfect edge domination and efficient edge domination in graphs
- On claw-free asteroidal triple-free graphs
- On approximating (connected) 2-edge dominating set by a tree
- On independent \([1, 2]\)-sets in trees
- On the achromatic number of signed graphs
- On the semitotal domination number of line graphs
- On directed covering and domination problems
- Parameterized algorithms and kernels for rainbow matching
- On two extensions of equimatchable graphs
- Maximum matching and kernelization of edge dominating set
- Minimum-cost b-edge dominating sets on trees
- Integer programming formulations for the minimum weighted maximal matching problem
- Parameterized measure \& conquer for problems with no small kernels
- Graph separators: A parameterized view
- Randomized approximation of the stable marriage problem
- An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
- Exact algorithms for edge domination
- Algorithmic aspects of clique-transversal and clique-independent sets
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- The complexity of total edge domination and some related results on trees
- Complexity and characterization aspects of edge-related domination for graphs
- Aspects of upper defensive alliances
- Algorithmic aspects of upper edge domination
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems
- On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem
- A note on approximations of directed edge dominating set
- Vertex cover at distance on \(H\)-free graphs
- A new approach on locally checkable problems
- Minimum maximal matchings in cubic graphs
- Global forcing number for maximal matchings in corona products
- Modelling and solving the perfect edge domination problem
- Improved deterministic distributed matching via rounding
- Domination versus edge domination
- Grundy coloring in some subclasses of bipartite graphs and their complements
- Improved budgeted connected domination and budgeted edge-vertex domination
- Bounding and approximating minimum maximal matchings in regular graphs
- Small \(k\)-pyramids and the complexity of determining \(k\)
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- Independent domination versus weighted independent domination
- Quadratic vertex kernel for rainbow matching
- A generalization of extension complexity that captures P
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set
- Solving Hamiltonian cycle by an EPT algorithm for a non-sparse parameter
- On the independent dominating set polytope
- Approximation hardness of edge dominating set problems
- A fixed-parameter tractable algorithm for matrix domination
- On some domination colorings of graphs
- More results on weighted independent domination
- Edge-stable equimatchable graphs
- Approximability of the capacitated \(b\)-edge dominating set problem
- The harmonious coloring problem is NP-complete for interval and permutation graphs
- NP-hard graph problems and boundary classes of graphs
- Generalizing the induced matching by edge capacity constraints
- Linear time algorithms for generalized edge dominating set problems
- Fractionally total colouring \(G_{n,p}\)
- Efficient approximation algorithms for the achromatic number
- Minimum 2-tuple dominating set of permutation graphs
- On dominating set polyhedra of circular interval graphs
- Computing the largest bond and the maximum connected cut of a graph
- 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
- Maximal matching polytope in trees
- On the maximum uniquely restricted matching for bipartite graphs
- Maximal matching and edge domination in complete multipartite graphs
- Geometric achromatic and pseudoachromatic indices
- A natural family of optimization problems with arbitrarily small approximation thresholds
- Hardness and approximation of minimum maximal matchings
- Minimum-cost \(b\)-edge dominating sets on trees
- Efficient equilibria in polymatrix coordination games
- On the complexity of variations of mixed domination on graphs
- On the algorithmic complexity of edge total domination
- Parameterized edge dominating set in cubic graphs (extended abstract)
- Approximating edge dominating set in dense graphs
- Enumerate and measure: improving parameter budget management
- A complexity dichotomy and a new boundary class for the dominating set problem
- Achromatic Number of K 5 × K n for Small n
- Independent Domination in Triangle Graphs
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
- Exact Algorithms for Edge Domination
- Tree-Width and Optimization in Bounded Degree Graphs
This page was built for publication: Edge Dominating Sets in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3903038)
