Search Results for ""

A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball ...

An (n,k)-talisman hexagon is an arrangement of nested hexagons containing the integers 1, 2, ..., H_n=3n(n-1)+1, where H_n is the nth hex number, such that the difference ...

An n×n array of the integers from 1 to n^2 such that the difference between any one integer and its neighbor (horizontally, vertically, or diagonally, without wrapping ...

2^(40)=1024^4=1099511627776 bytes. Although the term terabyte is sometimes used to refer to 1024^4 bytes, such usage is deprecated in favor of the standard SI naming ...

An ordered finite configuration with certain pairs of points, called cables, which are constrained not to get further apart and certain other pairs of points, called struts, ...

One trillion (10^(12)) bytes. Unfortunately, the term is sometimes also used to mean 2^(40)=1024^4=1099511627776 bytes. However, this usage is deprecated, and the term ...

A ternary tree is a tree-like structure that is rooted and in which each vertex has at most three children.

A self-avoiding walk in which steps may be to the left, right, or straight ahead after a vertical step, but only straight ahead or to the left after a horizontal step. A ...

A three-colorable graph G is a graph with chromatic number chi(G)<=3.

A simple unlabeled graph whose connectivity is considered purely on the basis of topological equivalence, so that two edges (v_1,v_2) and (v_2,v_3) joined by a node v_2 of ...