The following pages link to (Q4017197):
Displaying 42 items.
- Efficient domination through eigenvalues (Q317399) (← links)
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892) (← links)
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms (Q897596) (← links)
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
- Dominance made simple (Q987777) (← links)
- Blockbusting and domineering (Q1106742) (← links)
- Topics on domination (Q1188929) (← links)
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs (Q1313745) (← links)
- Regular codes in regular graphs are difficult (Q1336698) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- Weighted domination of cocomparability graphs (Q1382270) (← links)
- Efficient minus and signed domination in graphs (Q1399996) (← links)
- A dichotomy for weighted efficient dominating sets with bounded degree vertices (Q1628682) (← links)
- The many facets of upper domination (Q1704853) (← links)
- Fair domination number in cactus graphs (Q1717201) (← links)
- Domination cover rubbling (Q1741498) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- Efficient domination for classes of \(P_6\)-free graphs (Q2030432) (← links)
- A note on the fair domination number in outerplanar graphs (Q2194533) (← links)
- A characterization of perfect Roman trees (Q2197463) (← links)
- Perfect Italian domination on planar and regular graphs (Q2197486) (← links)
- Fair total domination number in cactus graphs (Q2227118) (← links)
- A generalization of Lee codes (Q2436575) (← links)
- Generalized perfect domination in graphs (Q2444147) (← links)
- \([1,2]\)-sets in graphs (Q2446878) (← links)
- (Q3353058) (← links)
- On perfect and quasiperfect dominations in graphs (Q5005483) (← links)
- Rainbow perfect domination in lattice graphs (Q5009971) (← links)
- Equitable fair domination in graphs (Q5025163) (← links)
- A Taxonomy of Perfect Domination (Q5069690) (← links)
- On the perfect differential of a graph (Q5070495) (← links)
- Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs (Q5075513) (← links)
- (Q5197611) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- Perfect domination and small cycles (Q5367522) (← links)
- Outer complete fair domination in graphs (Q5866027) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
- Parameterized complexity of minimum membership dominating set (Q6090540) (← links)
