Pages that link to "Item:Q1293201"
From MaRDI portal
The following pages link to On lower bounds for numbered complete graphs (Q1293201):
Displaying 10 items.
- A solution to an open problem on lower against number in graphs (Q266038) (← links)
- A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs (Q424181) (← links)
- Note on strict-double-bound numbers of nearly complete graphs missing some edges (Q658101) (← links)
- On lower bounds for numbered complete graphs (Q1293201) (← links)
- The upper bound on the Eulerian recurrent lengths of complete graphs obtained by an IP solver (Q2327525) (← links)
- A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph (Q2375856) (← links)
- A tabu search algorithm for difference triangle sets and Golomb rulers (Q2571189) (← links)
- Equivalence of some LP-based lower bounds for the Golomb ruler problem (Q2581563) (← links)
- (Q3791183) (← links)
- (Q4882972) (← links)