Pages that link to "Item:Q2495905"
From MaRDI portal
The following pages link to A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905):
Displaying 14 items.
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Discriminating codes in (bipartite) planar graphs (Q925038) (← links)
- Improved bounds on identifying codes in binary Hamming spaces (Q966138) (← links)
- Minimal identifying codes in trees and planar graphs with large girth (Q976158) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- Operads of finite posets (Q1753009) (← links)
- On the minimum size of an identifying code over all orientations of a graph (Q1753015) (← links)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- Identifying codes in the complementary prism of cycles (Q2132351) (← links)
- Identifying codes in line digraphs (Q2189840) (← links)
- On two variations of identifying codes (Q2275454) (← links)
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)