Search Results for ""

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

A natural equation is an equation which specifies a curve independent of any choice of coordinates or parameterization. The study of natural equations began with the ...

An orthogonal coordinate system is a system of curvilinear coordinates in which each family of surfaces intersects the others at right angles. Orthogonal coordinates ...

The path graph P_n is a tree with two nodes of vertex degree 1, and the other n-2 nodes of vertex degree 2. A path graph is therefore a graph that can be drawn so that all of ...

A linkage with six rods which draws the inverse of a given curve. When a pencil is placed at P, the inverse is drawn at P^' (or vice versa). If a seventh rod (dashed) is ...

The pentatope graph is the skeleton of the pentatope, namely the complete graph K_5. It is sometimes also known as the Kuratowski graph (Nikolić et al. 2000, p. 281). Since ...

A planar embedding, also called a "plane graph" (Harary 1994, p. 103; Harborth and Möller 1994), "planar drawing," or "plane drawing," of a planar graph is an embedding in ...

A class of map projections in which the parallels are represented by a system of non-concentric circular arcs with centers lying on the straight line representing the central ...

Pong Hau K'i is an ancient Chinese tic-tac-toe-like game involving two players with two differently colored stones (say, red and blue). The players move their respective ...

A pyramid is a polyhedron with one face (known as the "base") a polygon and all the other faces triangles meeting at a common polygon vertex (known as the "apex"). A right ...