BabelNet

bn:01383707n

Noun Concept

No term available

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

الرسم البياني الكمال

STUDIED BY

نظرية البيان