Pages that link to "Item:Q2851521"
From MaRDI portal
The following pages link to Identifying Codes in Trees and Planar Graphs (Q2851521):
Displaying 4 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- Minimum identifying codes in some graphs differing by matchings (Q4965914) (← links)
- Commutative rings introduce a class of identifiable graphs (Q6670665) (← links)
