Concept

Chromatic number — where it appears

The fewest colours a graph's vertices can take with no edge joining two of the same. For a mechanism's conflict graph it is the fewest parallel planes the links can be built in, and it is computed exactly rather than greedily because the answer is a claim rather than an upper bound.

Named by 2 essays across one field — each of them below, with the objects they name alongside it.

Named alongside it

The objects these essays reach for when they reach for this one.

Conflict graphInterferenceKinematic chainLayer assignmentLink bodyBearing pedestalBossEnumerationLower pairSigned clearanceSpatial mechanismStowed height

All concepts