Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01043271n
Noun Concept
Categories: Perfect graphs, Graph families
EN
trivially perfect graph  Aborescent comparability graph  Comparability graph of trees  comparability graphs of trees  Quasi-threshold graph
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
Definitions
Relations
Sources
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
IS A
cograph
permutation graph
graph
comparability graph
chordal graph
HAS KIND
windmill graph
STUDIED BY
graph theory
Wikipedia
EN
trivially perfect graph
Wikidata
EN
Trivially perfect graph
Wikipedia Redirections
EN
Aborescent comparability graph, Comparability graph of trees, comparability graphs of trees, Quasi-threshold graph

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