Pages that link to "Item:Q2630779"
From MaRDI portal
The following pages link to Constructions of binary codes based on bipartite graphs (Q2630779):
Displaying 5 items.
- Bi-resolving graph homomorphisms and extensions of bi-closing codes (Q368695) (← links)
- Discriminating codes in (bipartite) planar graphs (Q925038) (← links)
- Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity (Q1001641) (← links)
- Some combinatorial aspects of constructing bipartite-graph codes (Q1950398) (← links)
- (Q3511983) (← links)