Pages that link to "Item:Q2430979"
From MaRDI portal
The following pages link to Extremal graphs for the identifying code problem (Q2430979):
Displayed 8 items.
- Identifying path covers in graphs (Q396675) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
- Minimum sizes of identifying codes in graphs differing by one edge (Q2016394) (← links)
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092) (← links)
- Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
- (Q2857369) (← links)
- Identifying Codes in Line Graphs (Q5325952) (← links)