The following pages link to (Q3517160):
Displaying 11 items.
- On identifying codes in the Cartesian product of a path and a complete graph (Q281771) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
- Identifying codes in the direct product of a complete graph and some special graphs (Q1720324) (← 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)
- Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) (Q2506367) (← links)
- Identifying codes in trees and planar graphs (Q2851521) (← links)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- The identifying code number and Mycielski's construction of graphs (Q5104009) (← links)
- Stopping sets of codes from complete graph (Q5865694) (← links)
