Search Results for ""

Maximize the number of cookies you can cut from a given expanse of dough (Hoffman 1998, p. 173).

A term invented by B. Grünbaum in an attempt to promote concrete and precise polyhedron terminology. The word "coptic" derives from the Greek for "to cut," and acoptic ...

This problem is NP-complete (Garey and Johnson 1983).

An articulation vertex of a connected graph, also called a cut-vertex (Harary 1994, p. 26; West 2000; Gross and Yellen 2006) or "cutpoint" (Harary 1994, p. 26), is a vertex ...

A cylindrical segment, sometimes also called a truncated cylinder, is the solid cut from a circular cylinder by two (or more) planes. If there are two cutting planes, one ...

A section of a solid is the plane figure cut from the solid by passing a plane through it (Kern and Bland 1948, p. 18).

Consider a knot as being formed from two tangles. The following three operations are called mutations. 1. Cut the knot open along four points on each of the four strings ...

Let A be an edge cut of a connected graph G. Then the cyclic edge connectivity lambda_c(G) is the size of a smallest cyclic edge cut, i.e., a smallest edge cut A such that ...

Enclose a sphere in a cylinder and cut out a spherical segment by slicing twice perpendicularly to the cylinder's axis. Then the lateral surface area of the spherical segment ...

A graph G that becomes disconnected when removing a suitable complete subgraph K, called a vertex cut, is said to be quasiseparable. The two simplest cases are those where K ...