The following pages link to Edge Dominating Sets in Graphs (Q3903038):
Displaying 50 items.
- Geometric achromatic and pseudoachromatic indices (Q292239) (← links)
- A natural family of optimization problems with arbitrarily small approximation thresholds (Q293457) (← links)
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
- On total unimodularity of edge-edge adjacency matrices (Q378224) (← links)
- Parameterized edge dominating set in graphs with degree bounded by 3 (Q388085) (← links)
- New parameterized algorithms for the edge dominating set problem (Q392035) (← links)
- Vertex-decomposable graphs, codismantlability, Cohen-Macaulayness, and Castelnuovo-Mumford regularity (Q405058) (← links)
- A decidability result for the dominating set problem (Q410736) (← links)
- Edge domination in some path and cycle related graphs (Q470539) (← links)
- A refined exact algorithm for edge dominating set (Q477194) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Minimum order of graphs with given coloring parameters (Q488290) (← links)
- On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
- Total colorings of graphs with minimum sum of colors (Q503645) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
- \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619) (← links)
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Mind the independence gap (Q776261) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Results on the Grundy chromatic number of graphs (Q856867) (← links)
- Approximation algorithms for partially covering with edges (Q930925) (← links)
- Scheduling to maximize participation (Q935466) (← links)
- Saturation number of fullerene graphs (Q937610) (← links)
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)
- Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
- \(k\)-tuple domination in graphs (Q1014390) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- Concerning the achromatic number of graphs (Q1065819) (← links)
- Minimum-maximal matching in series-parallel graphs (Q1099085) (← links)
- Random edge domination (Q1210571) (← links)
- The b-chromatic number of a graph (Q1283791) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices (Q1309472) (← links)
- Edge domination in complete partite graphs (Q1336647) (← links)
- Edge domatic numbers of complete \(n\)-partite graphs (Q1340123) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- Small maximal matchings in random graphs. (Q1401316) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- Hard variants of stable marriage. (Q1605313) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- On claw-free asteroidal triple-free graphs (Q1613398) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- On independent \([1, 2]\)-sets in trees (Q1649903) (← links)
- On the achromatic number of signed graphs (Q1711838) (← links)
