Search Results for ""

A game played on a board of a given shape consisting of a number of holes of which all but one are initially filled with pegs. The goal is to remove all pegs but one by ...

The pentakis icosidodecahedral graph, illustrated above, is a graph on 42 vertices that is the skeleton of the pentakis icosidodecahedron.

A perfect graph is a graph G such that for every induced subgraph of G, the clique number equals the chromatic number, i.e., omega(G)=chi(G). A graph that is not a perfect ...

A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...

A periodic continued fraction is a continued fraction (generally a regular continued fraction) whose terms eventually repeat from some point onwards. The minimal number of ...

A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...

A permutation cycle is a subset of a permutation whose elements trade places with one another. Permutations cycles are called "orbits" by Comtet (1974, p. 256). For example, ...

The permutation symbol (Evett 1966; Goldstein 1980, p. 172; Aris 1989, p. 16) is a three-index object sometimes called the Levi-Civita symbol (Weinberg 1972, p. 38; Misner et ...

The integer sequence defined by the recurrence P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=3, P(1)=0, P(2)=2. This recurrence relation is the same as that for the ...

A planar hypohamiltonian graph is a hypohamiltonian graph that is also planar. A number of planar hypohamiltonian graphs are illustrated above. Chvátal (1973) first asked if ...