Pages that link to "Item:Q2376092"
From MaRDI portal
The following pages link to Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092):
Displayed 9 items.
- Identifying path covers in graphs (Q396675) (← links)
- Set graphs. IV. Further connections with claw-freeness (Q400530) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Domination and location in twin-free digraphs (Q777359) (← links)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- Identifying codes in line digraphs (Q2189840) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)