Search Results for ""

A line segment on the boundary of a face, also called a side.

A maximum clique of a graph G is a clique (i.e., complete subgraph) of maximum possible size for G. Note that some authors refer to maximum cliques simply as "cliques." The ...

A point-to-line and line-to-point transformation which transforms points A into lines a^' and lines b into points B^' such that a^' passes through B^' iff A^' lies on b.

Given a complete graph K_n which is two-colored, the number of forced monochromatic triangles is at least {1/3u(u-1)(u-2) for n=2u; 2/3u(u-1)(4u+1) for n=4u+1; ...

In a network with three graph edges at each graph vertex, the number of Hamiltonian cycles through a specified graph edge is 0 or even.

A shortest path between two vertices of a graph is a graph path of shortest possible length between them. Such paths are also known as graph geodesics, and the matrix giving ...

Young's geometry is a finite geometry which satisfies the following five axioms: 1. There exists at least one line. 2. Every line of the geometry has exactly three points on ...

A polyiamond consisting of equilateral triangles arranged along a line.

A point which does not lie on at least one ordinary line.

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