The following pages link to (Q4846497):
Displaying 8 items.
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- A 4-dimensional graph has at least 9 edges (Q385728) (← links)
- An effective and simple heuristic for the set covering problem (Q853015) (← links)
- Maximum number of edges joining vertices on a cube (Q1014401) (← links)
- Bounding the size of square-free subgraphs of the hypercube (Q1024494) (← links)
- Some Turán type results on the hypercube (Q1043648) (← links)
- Hypercube subgraphs with local detours (Q4229264) (← links)
- On the maximum number of edges in a <i>c</i><sub>4</sub>‐free subgraph of <i>q</i><sub><i>n</i></sub> (Q4320463) (← links)