Pages that link to "Item:Q2392684"
From MaRDI portal
The following pages link to Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684):
Displaying 6 items.
- Optimal identification of sets of edges using 2-factors (Q389983) (← links)
- Minimum sizes of identifying codes in graphs differing by one edge (Q2016394) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Minimum identifying codes in some graphs differing by matchings (Q4965914) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)
- Commutative rings introduce a class of identifiable graphs (Q6670665) (← links)
