Pages that link to "Item:Q925038"
From MaRDI portal
The following pages link to Discriminating codes in (bipartite) planar graphs (Q925038):
Displaying 10 items.
- Separating codes and traffic monitoring (Q1704860) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
- Separating Codes and Traffic Monitoring (Q2830061) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space (Q5386104) (← links)
- Discriminating Codes in Geometric Setups (Q6065423) (← links)
- Complexity and approximation for discriminating and identifying code problems in geometric setups (Q6107885) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)
