Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03520128n
Noun Concept
SYL
No term available
EN
In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every induced subgraph. Wikipedia
Relations
Sources
IS A
EN
graph
HAS KIND
EN
perfectly orderable graph
EN
bipartite graph
EN
trapezoid graph
EN
line graph
EN
comparability graph
+2 relations
HAS INSTANCE
EN
Möbius–Kantor graph
EN
Franklin graph
EN
Folkman graph
EN
Hoffman graph
EN
Herschel graph
+15 relations
STUDIED BY
EN
graph theory

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