Constructible graph — конструируемый граф.
Graph is constructible if it can be built vertex-by-vertex so that a vertex can be added to the currently constructed induced subgraph of if there exists a vertex of which is adjacent in to and to all neighbors of belonging to .
A graph is said to be constructible if there is a well-order on such that every vertex which is not the smallest element of is dominated by some vertex in the subgraph of induced by the set . The well-order on , and the enumeration of the vertices of induced by , will be called a constructing order and a constructing enumeration, respectively.
- Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.