Edge Dominating Sets in Graphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Approximation hardness of edge dominating set problems
- Algorithmic aspects of clique-transversal and clique-independent sets
- Edge domination and 2-independence in trees
- On the complexity of variations of mixed domination on graphs
- Minimum maximal acyclic matching in proper interval graphs
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs
- Concerning the achromatic number of graphs
- The edge-to-edge geodetic domination number of a graph
- Hardness and approximation results for some variants of stable marriage problem
- Max-min greedy matching problem: hardness for the adversary and fractional variant
- Minimum-maximal matching in series-parallel graphs
- Efficient equilibria in polymatrix coordination games
- Computing the largest bond and the maximum connected cut of a graph
- Smallest maximal matchings of graphs
- Edge domination in complete partite graphs
- Minimum 2-tuple dominating set of permutation graphs
- On two extensions of equimatchable graphs
- Improved approximation bounds for edge dominating set in dense graphs
- Graph separators: A parameterized view
- On directed covering and domination problems
- Parameterized algorithms and kernels for rainbow matching
- Approximability of the capacitated \(b\)-edge dominating set problem
- Vertex cover at distance on \(H\)-free graphs
- Approximating the Spanning k-Tree Forest Problem
- Minimum maximal matchings in cubic graphs
- On claw-free asteroidal triple-free graphs
- Parameterized Algorithms and Kernels for Rainbow Matching
- The harmonious coloring problem is NP-complete for interval and permutation graphs
- The total matching polytope of complete bipartite graphs
- Boundary Classes of Planar Graphs
- Graph colourings and partitions
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
- A sharp upper bound for the edge dominating number of hypergraphs with minimum degree
- On directed covering and domination problems
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs
- A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem
- Bibliography on domination in graphs and some basic definitions of domination parameters
- A 2-approximation algorithm for the minimum weight edge dominating set problem
- Enumerate and measure: improving parameter budget management
- Parameterized edge dominating set in cubic graphs (extended abstract)
- Hardness and approximation of minimum maximal matchings
- Upper and lower bounds on approximating weighted mixed domination
- Fast and simple local algorithms for 2-edge dominating sets and 3-total vertex covers
- Randomized approximation of the stable marriage problem
- On the maximum uniquely restricted matching for bipartite graphs
- A new approach on locally checkable problems
- Geometric achromatic and pseudoachromatic indices
- Maximum matching and kernelization of edge dominating set
- On two techniques of combining branching and treewidth
- Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity
- A natural family of optimization problems with arbitrarily small approximation thresholds
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems
- The complexity of König subgraph problems and above-guarantee vertex cover
- On the algorithmic complexity of edge total domination
- RESTRAINED EDGE DOMINATION IN GRAPHS
- On approximating (connected) 2-edge dominating set by a tree
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- Results on the Grundy chromatic number of graphs
- Aspects of upper defensive alliances
- Independent Domination in Triangle Graphs
- Getting linear time in graphs of bounded neighborhood diversity
- Integer programming formulations for the minimum weighted maximal matching problem
- A generalization of extension complexity that captures P
- On approximating (connected) 2-edge dominating set by a tree
- On approximability of the independent/connected edge dominating set problems
- Bounding and approximating minimum maximal matchings in regular graphs
- On kernelization for edge dominating set under structural parameters
- The algorithmic complexity of mixed domination in graphs
- Complexity framework for forbidden subgraphs. I: The framework
- Linear time algorithms for generalized edge dominating set problems
- An optimal algorithm for computing minimum k-hop dominating set of permutation graphs
- On achromatic number of central graph of some graphs
- On linear and circular structure of (claw, net)-free graphs
- Independent domination versus weighted independent domination
- Small \(k\)-pyramids and the complexity of determining \(k\)
- Class fairness in online matching
- Minimum-cost b-edge dominating sets on trees
- Improved budgeted connected domination and budgeted edge-vertex domination
- The b-chromatic number of a graph
- The complexity of total edge domination and some related results on trees
- Minimum-cost \(b\)-edge dominating sets on trees
- Approximating Alternative Solutions
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
- Scheduling to Maximize Participation
- Fractionally total colouring \(G_{n,p}\)
- New parameterized algorithms for the edge dominating set problem
- Algorithmic aspects of upper edge domination
- On the independent dominating set polytope
- \(k\)-tuple domination in graphs
- On the complexity of minimum maximal acyclic matchings
- Generalizing the induced matching by edge capacity constraints
- Extremal graphs for average sizes of maximal matchings
- Minimum maximal matchings in phenylene chains
- A complexity dichotomy and a new boundary class for the dominating set problem
- On some domination colorings of graphs
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set
- Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
- On total domination and minimum maximal matchings in graphs
- Intersection graphs of non-crossing paths
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)
