The following pages link to Edge Dominating Sets in Graphs (Q3903038):
Displayed 48 items.
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← 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)
- 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)
- Graph separators: A parameterized view (Q1877710) (← links)
- Randomized approximation of the stable marriage problem (Q1884845) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- On the independent dominating set polytope (Q2368719) (← links)
- Approximation hardness of edge dominating set problems (Q2369972) (← links)
- Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372) (← links)
- The harmonious coloring problem is NP-complete for interval and permutation graphs (Q2457020) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- Linear time algorithms for generalized edge dominating set problems (Q2480902) (← links)
- Fractionally total colouring \(G_{n,p}\) (Q2482106) (← links)
- Efficient approximation algorithms for the achromatic number (Q2503345) (← links)
- Achromatic Number of K 5 × K n for Small n (Q3366619) (← links)
- Independent Domination in Triangle Graphs (Q3439603) (← links)
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs (Q3502661) (← links)
- Exact Algorithms for Edge Domination (Q3503591) (← links)
- Tree-Width and Optimization in Bounded Degree Graphs (Q3508553) (← links)
- Approximating Alternative Solutions (Q3511329) (← links)
- Boundary Classes of Planar Graphs (Q3512606) (← links)
- A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem (Q3602847) (← links)
- Scheduling to Maximize Participation (Q3608460) (← links)
- Graph colourings and partitions (Q5941502) (← links)
- Domination in distance-hereditary graphs (Q5957300) (← links)