Pages that link to "Item:Q3439638"
From MaRDI portal
The following pages link to Discriminating codes in bipartite graphs (Q3439638):
Displaying 7 items.
- Discriminating codes in (bipartite) planar graphs (Q925038) (← 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)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← 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)