Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01043271n
Noun Concept
ES
No term available
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
IS A
cograph
gráfico de permutación
grafo
EN
comparability graph
gráfico de cuerdas
HAS KIND
EN
windmill graph
STUDIED BY
teoría de grafos

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License