Generalized complementation
type: Item
instance of: scholarly article
title: Generalized complementation
zbMATH Open document ID: 0587.05055
DOI: 10.1016/0095-8956(87)90054-2
published in: Journal of Combinatorial Theory. Series B
publication date: 1987-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 3941595
zbMATH Keywords: perfect graphs
zbMATH Keywords: graph complementation
zbMATH Keywords: self complementarity
zbMATH Keywords: semivalidity
zbMATH Keywords: complement
author: Terry A. McKee
MaRDI profile type: Publication
full work available at URL: 0095-8956(87)90054-2
OpenAlex ID: W2911232930
cites work: Q4187840
cites work: Transitiv orientierbare Graphen
cites work: Q3328583
cites work: Generalized equivalence and the foundations of quasigroups
cites work: Generalized equivalence and the phraseology of configuration theorems
cites work: Validity up to complementation in graph theory
cites work: Generalized equivalence: A pattern of mathematical expression
cites work: On a property of the class of n-colorable graphs
description: scientific article; zbMATH DE number 3941595