The following pages link to (Q4247463):
Displayed 49 items.
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- On the algorithmic complexity of \(k\)-tuple total domination (Q400524) (← links)
- \(k\)-rainbow domatic numbers (Q423920) (← links)
- NP-completeness and APX-completeness of restrained domination in graphs (Q442103) (← links)
- Generalized power domination of graphs (Q444434) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- Towards a new framework for domination (Q651449) (← links)
- Minimum 2-tuple dominating set of an interval graph (Q666518) (← links)
- On the \({k}\)-power domination of hypergraphs (Q887853) (← links)
- The upper bound on \(k\)-tuple domination numbers of graphs (Q925036) (← links)
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- Rainbow domination on trees (Q968106) (← links)
- A linear-time algorithm for paired-domination problem in strongly chordal graphs (Q990092) (← links)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs (Q1003667) (← links)
- \(k\)-tuple domination in graphs (Q1014390) (← links)
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs (Q1029052) (← links)
- Hardness results and approximation algorithms for (weighted) paired-domination in graphs (Q1034626) (← links)
- Distance paired-domination problems on subclasses of chordal graphs (Q1034627) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs (Q1735675) (← links)
- The weighted independent domination problem is NP-complete for chordal graphs (Q1887072) (← links)
- Power domination in circular-arc graphs (Q1939660) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- An \(O(n+m)\) time algorithm for computing a minimum semitotal dominating set in an interval graph (Q2053252) (← links)
- A linear-time algorithm for weighted paired-domination on block graphs (Q2168726) (← links)
- Partitioning vertices into in- and out-dominating sets in digraphs (Q2197403) (← links)
- The \(k\)-power domination problem in weighted trees (Q2290632) (← links)
- A linear-time algorithm for paired-domination on circular-arc graphs (Q2354407) (← links)
- On the independent dominating set polytope (Q2368719) (← links)
- On the dominating set polytope (Q2426444) (← links)
- Generalized perfect domination in graphs (Q2444147) (← links)
- Algorithmic aspect of stratified domination in graphs (Q2445324) (← links)
- Rainbow domination and related problems on strongly chordal graphs (Q2446318) (← links)
- Algorithmic aspects of the \(k\)-domination problem in graphs (Q2446334) (← links)
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs (Q2447764) (← links)
- Power domination in graphs (Q2502911) (← links)
- Minimum 2-tuple dominating set of permutation graphs (Q2511387) (← links)
- Some advances on the set covering polyhedron of circulant matrices (Q2636828) (← links)
- On dominating set polyhedra of circular interval graphs (Q2659194) (← links)
- Perfect secret sharing scheme based on vertex domination set (Q3451391) (← 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)
- An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774) (← links)
- ON SOME NEW GRACEFUL GRAPHS (Q5126465) (← links)
- Domination in distance-hereditary graphs (Q5957300) (← links)
- An efficient algorithm for distance total domination in block graphs (Q5963627) (← links)
- Power domination with bounded time constraints (Q5963647) (← links)
- \(k\)-power domination in block graphs (Q5963656) (← links)
- Algorithmic aspects of paired disjunctive domination in graphs (Q6100186) (← links)