Pages that link to "Item:Q1773205"
From MaRDI portal
The following pages link to Construction of codes identifying sets of vertices (Q1773205):
Displaying 14 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)
- Upper bounds for binary identifying codes (Q1012154) (← links)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- On cages admitting identifying codes (Q2426452) (← links)
- Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318) (← 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)
- Locating-Domination and Identification (Q3384611) (← links)
- Codes Identifying Vertices in Graphs (Q3439339) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)
