Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01383707n
Noun Concept
SYL
No term available
EN
In graph theory, a perfectly orderable graph is a graph whose vertices can be ordered in such a way that a greedy coloring algorithm with that ordering optimally colors every induced subgraph of the given graph. Wikipedia
Relations
Sources
IS A
EN
perfect graph
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