The following pages link to \(k\)-tuple domination in graphs (Q1014390):
Displaying 50 items.
- \((1, j)\)-set problem in graphs (Q294556) (← links)
- On the algorithmic complexity of \(k\)-tuple total domination (Q400524) (← links)
- Algorithmic aspects of \(k\)-tuple total domination in graphs (Q456136) (← links)
- Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351) (← links)
- Capacitated domination problem (Q534769) (← links)
- On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs (Q621581) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Minimum 2-tuple dominating set of an interval graph (Q666518) (← links)
- \(k\)-tuple total domination in graphs (Q708327) (← links)
- Onk-tuple domination of random graphs (Q735107) (← links)
- The k-neighbor domination problem (Q811346) (← links)
- A polyhedral view to a generalization of multiple domination (Q832985) (← links)
- The upper bound on \(k\)-tuple domination numbers of graphs (Q925036) (← links)
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
- The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs (Q998382) (← links)
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs (Q1029052) (← links)
- Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs (Q1045016) (← links)
- Liar's domination in graphs (Q1045132) (← links)
- Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
- Algorithmic aspect of \(k\)-tuple domination in graphs. (Q1860929) (← links)
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496) (← links)
- \(k\)-tuple total domination in cross products of graphs (Q1928523) (← links)
- The multiple domination and limited packing problems in graphs (Q1944215) (← links)
- Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803) (← links)
- Paired versus double domination in \(K_{1,r}\)-free graphs (Q2015806) (← links)
- Double vertex-edge domination in graphs: complexity and algorithms (Q2053214) (← links)
- On \(d\)-distance \(m\)-tuple \((\ell,r)\)-domination in graphs (Q2059873) (← links)
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
- Tuple domination on graphs with the consecutive-zeros property (Q2132374) (← links)
- Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\) (Q2147590) (← links)
- Complexity of edge monitoring on some graph classes (Q2172388) (← links)
- Liar's dominating set problem on unit disk graphs (Q2201773) (← links)
- Algorithms for generating strongly chordal graphs (Q2233439) (← links)
- Hardness results, approximation and exact algorithms for liar's domination problem in graphs (Q2257297) (← links)
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs (Q2330102) (← links)
- Upper bounds for the domination numbers of graphs using Turán's theorem and Lovász local lemma (Q2334078) (← links)
- Generalized limited packings of some graphs with a limited number of \(P_4\)-partners (Q2344754) (← links)
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849) (← links)
- On the \(k\)-tuple domination of de Bruijn and Kautz digraphs (Q2380002) (← links)
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
- Rainbow domination and related problems on strongly chordal graphs (Q2446318) (← links)
- Algorithmic aspects of the \(k\)-domination problem in graphs (Q2446334) (← links)
- Limited packing and multiple domination problems: polynomial time reductions (Q2448892) (← links)
- Restricted domination parameters in graphs (Q2467572) (← links)
- A generalised upper bound for the \(k\)-tuple domination number (Q2470457) (← links)
- Minimum 2-tuple dominating set of permutation graphs (Q2511387) (← links)
- Polynomial reductions between the limited packing and tuple domination problems in graphs (Q2840710) (← links)
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs (Q2883613) (← links)
- \((k,r)\)-domination in graphs (Q2908008) (← links)
