The following pages link to (Q3870917):
Displaying 50 items.
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- Edge domination in some path and cycle related graphs (Q470539) (← links)
- A note on an induced subgraph characterization of domination perfect graphs (Q516908) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
- On domination and independent domination numbers of a graph (Q754234) (← links)
- Dominating sets for split and bipartite graphs (Q794174) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- \(k\)-tuple domination in graphs (Q1014390) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Line domination in graphs (Q1092932) (← links)
- On graphs with equal domination and independent domination numbers (Q1182987) (← links)
- Linear algorithms on recursive representations of trees (Q1254104) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Edge domination in complete partite graphs (Q1336647) (← links)
- Edge domatic numbers of complete \(n\)-partite graphs (Q1340123) (← links)
- A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- On independent \([1, 2]\)-sets in trees (Q1649903) (← links)
- Integer programming formulations for the minimum weighted maximal matching problem (Q1758060) (← links)
- An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem (Q1944924) (← links)
- The complexity of total edge domination and some related results on trees (Q2023114) (← links)
- Complexity and characterization aspects of edge-related domination for graphs (Q2023127) (← links)
- On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem (Q2085737) (← links)
- Minimum maximal matchings in cubic graphs (Q2144321) (← links)
- Approximation hardness of edge dominating set problems (Q2369972) (← links)
- Roman edge semi-total block domination of a graph (Q2422074) (← links)
- Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- Linear time algorithms for generalized edge dominating set problems (Q2480902) (← links)
- On well-edge-dominated graphs (Q2673496) (← links)
- 2-(edge-)connected edge domination number and matching number (Q2698534) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs (Q3502661) (← links)
- (Q4581873) (← links)
- A note on the edge Roman domination in trees (Q5006593) (← links)
- Bounds on total edge domination number of a tree (Q5012811) (← links)
- Edge domination and 2-independence in trees (Q5013448) (← links)
- EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKET (Q5025346) (← links)
- The edge-to-edge geodetic domination number of a graph (Q5027740) (← links)
- Vertex-Edge Roman Domination (Q5035233) (← links)
- RESTRAINED EDGE DOMINATION IN GRAPHS (Q5035971) (← links)
- Edge domination in Boolean function graph B(L(G), NINC) of a graph (Q5036688) (← links)
- On the domination number of a graph and its block graph (Q5057740) (← links)
- On coefficients of edge domination polynomial of a graph (Q5069790) (← links)
- RESTRAINED TOTAL EDGE DOMINATION IN THE JOIN OF GRAPHS (Q5075624) (← links)
- PERFECT EDGE DOMINATION IN GRAPHS (Q5076135) (← links)
- (Q5076568) (← links)
- Edges contained in all or in no minimum edge dominating set of a tree (Q5197545) (← links)
