The following pages link to Identifying codes of cycles (Q2488842):
Displaying 28 items.
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Extension of universal cycles for globally identifying colorings of cycles (Q526222) (← links)
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- Identifying codes of cycles with odd orders (Q942141) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- On \(r\)-locating-dominating sets in paths (Q1024298) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- Identifying codes in the direct product of a complete graph and some special graphs (Q1720324) (← links)
- Progress on the description of identifying code polyhedra for some families of split graphs (Q1751187) (← links)
- Optimal identifying codes in cycles and paths (Q1926037) (← links)
- The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations (Q2132340) (← links)
- Identifying codes in the complementary prism of cycles (Q2132351) (← links)
- Optimal identifying codes of two families of Cayley graphs (Q2166227) (← links)
- Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (Q2186954) (← links)
- New results of identifying codes in product graphs (Q2245049) (← links)
- On two variations of identifying codes (Q2275454) (← links)
- Optimal bounds on codes for location in circulant graphs (Q2311421) (← links)
- New results on variants of covering codes in Sierpiński graphs (Q2391669) (← links)
- Identifying codes of the direct product of two cliques (Q2441624) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318) (← links)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- (Q4470466) (← links)
- The identifying code number and Mycielski's construction of graphs (Q5104009) (← links)
- (Q5878174) (← links)
