Pages that link to "Item:Q596073"
From MaRDI portal
The following pages link to Identifying codes in some subgraphs of the square lattice (Q596073):
Displaying 23 items.
- A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs (Q284833) (← links)
- The minimum identifying code graphs (Q423972) (← links)
- Generic algorithms for some decision problems on fasciagraphs and rotagraphs (Q442402) (← links)
- Identifying codes for infinite triangular grids with a finite number of rows (Q526246) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- Identifying codes of cycles with odd orders (Q942141) (← links)
- Identifying codes of Cartesian product of two cliques of the same size (Q1010656) (← links)
- Periodicity of identifying codes in strips (Q1708274) (← links)
- Polyhedra associated with identifying codes in graphs (Q1752479) (← links)
- Optimal identifying codes in cycles and paths (Q1926037) (← links)
- Identifying codes in the complementary prism of cycles (Q2132351) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- On minimum identifying codes in some Cartesian product graphs (Q2409538) (← links)
- The number of completely different optimal identifying codes in the infinite square grid (Q2410258) (← links)
- Identifying codes of cycles (Q2488842) (← links)
- On identifying codes (Q2717197) (← links)
- Minimum-Density Identifying Codes in Square Grids (Q2830060) (← links)
- Vertex identifying codes for the \(n\)-dimensional lattice (Q2906869) (← links)
- Liar's domination (Q3057104) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Minimum density of identifying codes of king grids (Q5915700) (← links)
- Minimum density of identifying codes of king grids (Q5920174) (← links)
- Density of identifying codes of hexagonal grids with finite number of rows (Q6550909) (← links)
