Pages that link to "Item:Q267807"
From MaRDI portal
The following pages link to On the ensemble of optimal identifying codes in a twin-free graph (Q267807):
Displaying 8 items.
- On the number of optimal identifying codes in a twin-free graph (Q476309) (← links)
- Induced paths in twin-free graphs (Q1010672) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- Minimum sizes of identifying codes in graphs differing by one edge (Q2016394) (← links)
- Which graphs occur as \(\gamma\)-graphs? (Q2191276) (← links)
- On the ensemble of optimal dominating and locating-dominating codes in a graph (Q2346565) (← links)
- Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)