The following pages link to (Q4474243):
Displaying 15 items.
- Optimal identification of sets of edges using 2-factors (Q389983) (← links)
- The minimum identifying code graphs (Q423972) (← links)
- Partial linear spaces and identifying codes (Q627920) (← links)
- Adaptive identification in graphs (Q958720) (← links)
- Optimal codes for strong identification (Q1612759) (← links)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- Characterizing identifying codes from the spectrum of a graph or digraph (Q2418997) (← links)
- On cages admitting identifying codes (Q2426452) (← 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)
- Edge identifying codes (Q2857369) (← links)
- Vertex identifying codes for the \(n\)-dimensional lattice (Q2906869) (← links)
- Liar's domination (Q3057104) (← links)
- Codes Identifying Vertices in Graphs (Q3439339) (← links)
