Pages that link to "Item:Q1860929"

The following pages link to Algorithmic aspect of \(k\)-tuple domination in graphs. (Q1860929):

Displaying 37 items.

• On the algorithmic complexity of \(k\)-tuple total domination (Q400524) (← links)
• On disjoint maximal independent sets in graphs (Q458376) (← links)
• Capacitated domination problem (Q534769) (← links)
• On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs (Q621581) (← links)
• \(k\)-tuple total domination in graphs (Q708327) (← 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)
• The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs (Q998382) (← links)
• \(k\)-tuple domination in graphs (Q1014390) (← 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)
• \(k\)-tuple total domination in cross products of graphs (Q1928523) (← links)
• The multiple domination and limited packing problems in graphs (Q1944215) (← links)
• Liar's domination in graphs: complexity and algorithm (Q1949115) (← 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)
• Hardness results, approximation and exact algorithms for liar's domination problem in graphs (Q2257297) (← links)
• Upper bounds for the domination numbers of graphs using Turán's theorem and Lovász local lemma (Q2334078) (← 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, P4-tidy and split graphs (Q2883613) (← links)
• On the complexity of the labeled domination problem in graphs (Q2968509) (← links)
• Multiple Domination (Q3384609) (← links)
• An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
• An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
• (Q5377028) (← links)
• Capacitated Domination Problem (Q5387762) (← links)
• A note on the \(k\)-tuple total domination number of a graph (Q5964651) (← links)