Solving the n_1 × n_2 × n_3 Points Problem for n_3 < 6 Published: 2022/06/14 Marco RipàCategories Graphs and Matroids Tags connectivity, Covering path, Game, graph theory, Link-length, Outside the box, Point, three-dimensional, Upper bound In this paper, we show enhanced upper bounds of the nontrivial n_1 × n_2 × n_3 points problem for every n_1