Generalized complementation
Certain simple phenomena of graph complementation -- selfcomplementarity and semivalidity (truth in every graph or its complement) -- can be ``lifted'' to the natural generalization of complementation involving three-coloring the edges of complete graphs. An additional assumption is needed that no tricolored triangles occur. Similar phenomena occur in lifting properties of complete graphs to regular complementation involving two-coloring the edges of complete graphs. The corresponding additional assumption is that no induced monochromatic paths of length three occur.
scientific article; zbMATH DE number 3941595