The following pages link to The minimum identifying code graphs (Q423972):
Displaying 12 items.
- A comparison of approaches for finding minimum identifying codes on graphs (Q296102) (← links)
- Constructing codes identifying sets of vertices (Q851780) (← links)
- Codings of graphs with binary edge labels (Q1323484) (← links)
- On the minimum size of an identifying code over all orientations of a graph (Q1753015) (← links)
- Construction of codes identifying sets of vertices (Q1773205) (← links)
- Identifying codes of lexicographic product of graphs (Q1953370) (← links)
- Bounds on the identifying codes in trees (Q2000553) (← links)
- Identifying codes on directed de Bruijn graphs (Q2416416) (← links)
- Extremal graphs for the identifying code problem (Q2430979) (← links)
- Choice identification of a graph (Q2440100) (← links)
- The identifying code number and Mycielski's construction of graphs (Q5104009) (← links)
- Minimal Graphs with a Specified Code Map Image (Q5225549) (← links)