Generalized complementation (Q1072574): Difference between revisions
From MaRDI portal
Latest revision as of 13:09, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalized complementation |
scientific article |
Statements
Generalized complementation (English)
0 references
1987
0 references
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.
0 references
perfect graphs
0 references
graph complementation
0 references
self complementarity
0 references
semivalidity
0 references
complement
0 references
