Pages that link to "Item:Q2446882"
From MaRDI portal
The following pages link to New bounds on the minimum density of an identifying code for the infinite hexagonal grid (Q2446882):
Displayed 11 items.
- Identifying codes for infinite triangular grids with a finite number of rows (Q526246) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- Operads of finite posets (Q1753009) (← links)
- On the minimum size of an identifying code over all orientations of a graph (Q1753015) (← links)
- Open locating-dominating sets in circulant graphs (Q2062672) (← links)
- Optimal open-locating-dominating sets in infinite triangular grids (Q2354721) (← links)
- Minimum-Density Identifying Codes in Square Grids (Q2830060) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Open-independent, open-locating-dominating sets (Q5006616) (← links)
- Minimum density of identifying codes of king grids (Q5915700) (← links)
- Minimum density of identifying codes of king grids (Q5920174) (← links)