The following pages link to (Q4659582):
Displaying 19 items.
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Identifying codes and locating-dominating sets on paths and cycles (Q642979) (← links)
- Identifying codes of cycles with odd orders (Q942141) (← links)
- Minimal identifying codes in trees and planar graphs with large girth (Q976158) (← links)
- Identifying codes in the direct product of a complete graph and some special graphs (Q1720324) (← links)
- Identifying and locating-dominating codes on chains and cycles (Q1883609) (← links)
- Identifying codes in the complementary prism of cycles (Q2132351) (← links)
- Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (Q2186954) (← links)
- On two variations of identifying codes (Q2275454) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Extremal graphs for the identifying code problem (Q2430979) (← links)
- Identifying codes of the direct product of two cliques (Q2441624) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- Identifying codes of cycles (Q2488842) (← links)
- A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905) (← links)
- Liar's domination (Q3057104) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
