Color-families are dense
Emo Welzl · Theoretical Computer Science · 1982
Graphs, regarded as grammar forms as well as coloring specifications, induce graph-families, so-called color-families. In this paper a minimal producer-graph for every color-family is introduced and as the main result it is shown that color-families are dense, in the sense that between any two families one can ‘squeeze in’ another one.