Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01383707n
Noun Concept
Categories: Graph coloring, Perfect graphs
EN
perfectly orderable graph
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
Definitions
Relations
Sources
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
special case of the perfect graphs in graph theory Wikidata
IS A
perfect graph
STUDIED BY
graph theory
Wikipedia
EN
perfectly orderable graph
Wikidata
EN
Perfectly orderable 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