Search Results for ""

The intersection number omega(G) of a given graph G is the minimum number of elements in a set S such that G is an intersection graph on S.

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

The Miquel configuration is the 6_4 configuration illustrated above. Its Levi graph is the rhombic dodecahedral graph.

A graph H is called a topological minor, also known as a homeomorphic subgraph, of a graph G if a graph subdivision of H is isomorphic to a subgraph of G. Every topological ...

Line segment ranges and pencils which have equal cross ratios are said to be equicross.

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...

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

A half-plane is a planar region consisting of all points on one side of an infinite straight line, and no points on the other side. If the points on the line are included, ...

A one-dimensional geometric object such as a pencil or line segment range.