bn:03549726n
Noun Concept
Categories: Graph coloring
EN
harmonious coloring  Harmonius chromatic number
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
Definitions
Relations
Sources
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
Wikipedia
Wikidata
Wikipedia Redirections