The following pages link to (Q4017197):
Displayed 7 items.
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← 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)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)