Search Results for ""

A path constructed by repeatedly finding a path of positive capacity from a source to a sink and then adding it to the flow (Skiena 1990, p. 237). An augmenting path for a ...

A circuit in which an entire graph is traversed in one route. Examples of curves that can be traced unicursally are the Mohammed sign and unicursal hexagram. The numbers of ...

If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...

The Hungarian algorithm finds a maximum independent edge set on a graph. The algorithm starts with any matching M and constructs a tree via a breadth-first search to find an ...

An automorphism is an isomorphism of a system of objects onto itself. The term derives from the Greek prefix alphaupsilontauomicron (auto) "self" and ...

In plane geometry, a chord is the line segment joining two points on a curve. The term is often used to describe a line segment whose ends lie on a circle. The term is also ...

A bar graph is any plot of a set of data such that the number of data elements falling within one or more categories is indicated using a rectangle whose height or width is a ...

The diagonal of a polyhedron is any line segment connecting two nonadjacent vertices of the polyhedron. Any polyhedron having no diagonals must have a skeleton which is a ...

The Icosian game, also called the Hamiltonian game (Ball and Coxeter 1987, p. 262), is the problem of finding a Hamiltonian cycle along the edges of an dodecahedron, i.e., a ...

There are (at least) two graphs associated with Ellingham and Horton. These graphs on 54 and 78 nodes respectively, illustrated above, are examples of 3-connected bicubic ...