The following pages link to (Q4242950):
Displaying 9 items.
- Covering complete hypergraphs with cuts of minimum total size (Q659756) (← links)
- On the biclique cover of the complete graph (Q897237) (← links)
- On the minimum average distance of binary constant weight codes (Q932637) (← links)
- On the variance of average distance of subsets in the Hamming space (Q1765526) (← links)
- Optimal partial clique edge covering guided by potential energy minimization (Q2329666) (← links)
- A bound on the total size of a cut cover (Q2484376) (← links)
- AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES (Q3063606) (← links)
- Covering Complete <i>r</i>-Graphs with Spanning Complete <i>r</i>-Partite <i>r</i>-Graphs (Q5199506) (← links)
- On the minimum average distance of binary codes: Linear programming approach (Q5939230) (← links)