The following pages link to (Q4017197):
Displayed 16 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)
- 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)
- 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 generalization of Lee codes (Q2436575) (← links)
- Generalized perfect domination in graphs (Q2444147) (← links)
- \([1,2]\)-sets in graphs (Q2446878) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)