Pages that link to "Item:Q2380847"
From MaRDI portal
The following pages link to New bounds for (\(r, \leq 2\))-identifying codes in the infinite king grid (Q2380847):
Displaying 14 items.
- On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid (Q414945) (← links)
- Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice (Q882790) (← links)
- On identifying codes in the King grid that are robust against edge deletions (Q1010708) (← links)
- Codes for identification in the king lattice (Q1423495) (← links)
- Lower bounds for identifying codes in some infinite grids (Q1960276) (← links)
- An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid (Q2437959) (← links)
- Optimal identifying codes in the infinite 3-dimensional king grid (Q2441660) (← links)
- Optimal \((r,\leq 3)\)-locating-dominating codes in the infinite king grid (Q2444553) (← links)
- New lower bound for 2-identifying code in the square grid (Q2446847) (← links)
- On locating-dominating codes in the infinite king grid. (Q2828920) (← links)
- Improved Bounds for<i>r</i>-Identifying Codes of the Hex Grid (Q3094905) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Minimum density of identifying codes of king grids (Q5915700) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)