The following pages link to (Q3802605):
Displaying 19 items.
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892) (← links)
- Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity (Q1001641) (← links)
- Compatible 2-factors (Q1193724) (← links)
- Regular codes in regular graphs are difficult (Q1336698) (← links)
- Structural parameterization for minimum conflict-free colouring (Q2161251) (← links)
- On graphs and codes preserved by edge local complementation (Q2260792) (← links)
- Pattern matching with variables: a multivariate complexity analysis (Q2346415) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- A generalization of Lee codes (Q2436575) (← links)
- Lattice-like total perfect codes (Q2442269) (← links)
- Bounds on codes derived by counting components in Varshamov graphs (Q2491316) (← links)
- Finding Consensus Strings with Small Length Difference Between Input and Solution Strings (Q2946423) (← links)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- On a code problem concerning planar acyclic graphs (Q3350765) (← links)
- Codes on graphs: normal realizations (Q4544504) (← links)
- On the Complexity of Solving Restricted Word Equations (Q4683237) (← links)
- (Q4949280) (← links)
- Codes on graphs: Recent progress (Q5951414) (← links)
- Parameterized complexity of minimum membership dominating set (Q6090540) (← links)
