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