The following pages link to (Q4510800):
Displayed 9 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- On binary linear \(r\)-identifying codes (Q540477) (← links)
- On identifying codes in binary Hamming spaces (Q696908) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- New identifying codes in the binary Hamming space (Q966160) (← links)
- Upper bounds for binary identifying codes (Q1012154) (← links)
- The minimum density of an identifying code in the king lattice. (Q1422415) (← links)
- On the density of identifying codes in the square lattice (Q1850615) (← links)
- Liar's domination (Q3057104) (← links)