Decomposable
131Distance-hereditary graph — A distance hereditary graph. In graph theoretic mathematics, a distance hereditary graph (also called a completely separable graph)[1] is a graph in which the distances in any connected induced subgraph are the same as they are in the original… …
132Michael selection theorem — In functional analysis, a branch of mathematics, the most popular version of the Michael selection theorem, named after Ernest Michael, states the following: Let E be a Banach space, X a paracompact space and φ : X → E a lower semicontinuous …
