Pages that link to "Item:Q3004664"

The following pages link to Complexity of Total {k}-Domination and Related Problems (Q3004664):

Displaying 12 items.

• Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs (Q1653049) (← links)
• More results on the complexity of domination problems in graphs (Q1664084) (← links)
• The complexity of total edge domination and some related results on trees (Q2023114) (← links)
• A new approach on locally checkable problems (Q2127611) (← links)
• Global total \(k\)-domination: approximation and hardness results (Q2216425) (← links)
• The inapproximability of \(k\)-dominatingSet for parameterized \(\mathsf{{AC}^0}\) circuits (Q2327096) (← links)
• On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849) (← links)
• On the global total $k$-domination number of graphs (Q2420407) (← links)
• Total \(\{k\}\)-domination in special graphs (Q2668541) (← links)
• On the complexity of the labeled domination problem in graphs (Q2968509) (← links)
• NP-completeness results for partitioning a graph into total dominating sets (Q5918107) (← links)
• Hardness results of global total \(k\)-domination problem in graphs (Q5918768) (← links)