Search Results for ""

A tree spread in which each node has a finite number of children.

A theory of Hamiltonian cycles.

A relation R on a set S is transitive provided that for all x, y and z in S such that xRy and yRz, we also have xRz.

A great circle is a section of a sphere that contains a diameter of the sphere (Kern and Bland 1948, p. 87). Sections of the sphere that do not contain a diameter are called ...

Given two circles with one interior to the other, if small tangent circles can be inscribed around the region between the two circles such that the final circle is tangent to ...

Two trains are on the same track a distance 100 km apart heading towards one another, each at a speed of 50 km/h. A fly starting out at the front of one train, flies towards ...

A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.

A Ramsey number of the form R(k,k;2).

Edge splitting is the reverse of edge contraction.

An elegant algorithm for constructing an Eulerian cycle (Skiena 1990, p. 193).