Pages that link to "Item:Q2392684"

The following pages link to Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684):

Displayed 4 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)