The following pages link to (Q4892794):
Displaying 15 items.
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems (Q392025) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
- On weak odd domination and graph-based quantum secret sharing (Q496043) (← links)
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
- An almost complete description of perfect codes in direct products of cycles (Q864867) (← links)
- Perfect codes in direct products of cycles-a complete characterization (Q931836) (← links)
- Characterizing \(r\)-perfect codes in direct products of two and three cycles (Q1041710) (← links)
- Regular codes in regular graphs are difficult (Q1336698) (← links)
- A dichotomy for weighted efficient dominating sets with bounded degree vertices (Q1628682) (← links)
- Efficient domination for classes of \(P_6\)-free graphs (Q2030432) (← links)
- When an optimal dominating set with given constraints exists (Q2420615) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- Parameterized Complexity in Multiple-Interval Graphs: Domination (Q2891335) (← links)
- Perfect codes in direct products of cycles (Q3439335) (← links)
