meet end to end

See: border, bound
Mentioned in ?
References in periodicals archive ?
One group of matchstick (or toothpick) problems involves constructing patterns in which a given number of sticks meet end to end (without crossing each other) at every point in a geometric figure on a flat surface.