Pages that link to "Item:Q476309"
From MaRDI portal
The following pages link to On the number of optimal identifying codes in a twin-free graph (Q476309):
Displaying 13 items.
- On the ensemble of optimal identifying codes in a twin-free graph (Q267807) (← links)
- Extension of universal cycles for globally identifying colorings of cycles (Q526222) (← links)
- Structural properties of twin-free graphs (Q870075) (← links)
- Induced paths in twin-free graphs (Q1010672) (← links)
- Twin subgraphs and core-semiperiphery-periphery structures (Q1722674) (← 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)
- Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684) (← links)
- Extremal values for the maximum degree in a twin-free graph. (Q2864455) (← links)
- Extremal values for identification, domination and maximum cliques in twin-free graphs. (Q2918543) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Some results about a conjecture on identifying codes in complete suns (Q6070992) (← links)
- On Iiro Honkala's contributions to identifying codes (Q6614534) (← links)