Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03549726n
Noun Concept
AR
No term available
EN
In graph theory, a harmonious coloring is a vertex coloring in which every pair of colors appears on at most one pair of adjacent vertices. Wikipedia
Relations
Sources
IS A
مسألة تلوين المخطط

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