Pages that link to "Item:Q3002553"
From MaRDI portal
The following pages link to Complexity results for identifying codes in planar graphs (Q3002553):
Displaying 10 items.
- More results on the complexity of identifying problems in graphs (Q264560) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes (Q1733054) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Bounding the trace function of a hypergraph with applications (Q2089531) (← links)
- Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- Identifying Codes in Trees and Planar Graphs (Q2851521) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)