Universal Sets for Straight-Line Embeddings of Bicolored Graphs

Josef Cibulka, Jan Kyncl, Viola Mészáros +2

A set S of n points is 2-color universal for a graph G on n vertices if for every proper 2-coloring of G and for every 2-coloring of S with the same sizes of color classes as G has…