Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03520128n
Noun Concept
Categories: Perfect graphs
EN
perfect graph  berge graph  odd antihole  odd hole
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
Definitions
Relations
Sources
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
type of graph Wikidata
IS A
graph
HAS KIND
perfectly orderable graph
bipartite graph
trapezoid graph
line graph
comparability graph
+2 relations
HAS INSTANCE
Möbius–Kantor graph
Franklin graph
Folkman graph
Hoffman graph
Herschel graph
+15 relations
STUDIED BY
graph theory
Wikipedia
EN
perfect graph
Wikidata
EN
perfect graph
Wikipedia Redirections
EN
Berge graph, odd antihole, odd hole
Wikidata Alias
EN
berge 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