Search Results for ""

A stack is a data structure which is a special kind of list in which elements may be added to or removed from the top only. These actions are called a push or a pop, ...

A straight line embedding, or "straight line drawing," of a graph is a graph embedding in which all edges are drawn as straight line segments (as opposed to curves, etc.).

The straight polyomino of order n is the n-polyomino in which all squares are placed along a line.

A generalization of Ramsey theory to mathematical objects in which one would not normally expect structure to be found. For example, there exists a graph with very few ...

A tree G^' whose graph vertices and graph edges form subsets of the graph vertices and graph edges of a given tree G.

If G^' is a subgraph of G, then G is said to be a supergraph of G^'.

A symmetric design is a block design (v, k, lambda, r, b) with the same number of blocks as points, so b=v (or, equivalently, r=k). An example of a symmetric block design is ...

The order n T-polyomino consists of a vertical line of n-3 squares capped by a horizontal line of three squares centered on the line.

A 3-coloring of graph edges so that no two edges of the same color meet at a graph vertex (Ball and Coxeter 1987, pp. 265-266).

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 ...