bn:01043271n
Noun Concept
IT
grafico banalmente perfetto
EN
In graph theory, a trivially perfect graph is a graph with the property that in each of its induced subgraphs the size of the maximum independent set equals the number of maximal cliques. Wikipedia
Relations
Sources