Search Results for ""

Edge splitting is the reverse of edge contraction.

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

The problem of deciding if four colors are sufficient to color any map on a plane or sphere.

As shown by Schur (1916), the Schur number S(n) satisfies S(n)<=R(n)-2 for n=1, 2, ..., where R(n) is a Ramsey number.

The Parts graphs are a set of unit-distance graphs with chromatic number five derived by Jaan Parts in 2019-2020 (Parts 2020a). They provide some of the smallest known ...

A generalization of the polyominoes using a collection of equal-sized equilateral triangles (instead of squares) arranged with coincident sides. Polyiamonds are sometimes ...

Given three jugs with x pints in the first, y in the second, and z in the third, obtain a desired amount in one of the vessels by completely filling up and/or emptying ...

The 14-faced Archimedean solid with faces 8{3}+6{8}. It is also the uniform polyhedron with Maeder index 9 (Maeder 1997), Wenninger index 8 (Wenninger 1989), Coxeter index 21 ...

The truncated tetrahedron is the Archimedean solid with faces 4{3}+4{6}. It is also the uniform polyhedron with Maeder index 2 (Maeder 1997), Wenninger index 6 (Wenninger ...

The braced square problem asks, given a hinged square composed of four equal rods (indicated by the red lines above), how many more hinged rods must be added in the same ...