Search Results for ""

The stomachion is a 14-piece dissection puzzle similar to tangrams. It is described in fragmentary manuscripts attributed to Archimedes as noted by Magnus Ausonius (310-395 ...

A triangle center function (sometimes simply called a center function) is a nonzero function f(a,b,c) that is homogeneous f(ta,tb,tc)=t^nf(a,b,c) (1) bisymmetry in b and c, ...

Tutte (1971/72) conjectured that there are no 3-connected nonhamiltonian bicubic graphs. However, a counterexample was found by J. D. Horton in 1976 (Gropp 1990), and several ...

A unigraphic graph (or simply a "unigraph") is a graph that is isomorphic to every graph having that degree sequence. All graphs on four are fewer vertices are unigraphic. ...

The Weisfeiler-Leman dimension dim_(WL)(G) of a graph G, sometimes known as the WL dimension, is the smallest integer d such that the d-dimensional Weisfeiler-Leman algorithm ...

A zebra graph is a graph formed by all possible moves of a hypothetical chess piece called a "zebra" which moves analogously to a knight except that it is restricted to moves ...

The simple continued fraction representations of e given by [2; 1, 2, 1, 1, 4, 1, 1, 6, ...] (OEIS A003417). This continued fraction is sometimes known as Euler's continued ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

The term "snark" was first popularized by Gardner (1976) as a class of minimal cubic graphs with edge chromatic number 4 and certain connectivity requirements. (By Vizing's ...

Origami is the Japanese art of paper folding. In traditional origami, constructions are done using a single sheet of colored paper that is often, though not always, square. ...