Harmonious coloring
id:
harmonious-coloring-277-7319058
title:
Harmonious coloring
text:
In graph theory, a harmonious coloring is a (proper) vertex coloring in which every pair of colors appears on at most one pair of adjacent vertices. It is the opposite of the complete coloring, which instead requires every color pairing to occur at least once. The harmonious chromatic number χH(G) of a graph G is the minimum number of colors needed for any harmonious coloring of G. Every graph has a harmonious coloring, since it suffices to assign every vertex a distinct color; thus χH(G) ≤ |V(G
brand slug:
wiki
category slug:
encyclopedia
description:
Vertex coloring where no two linked nodes have the same color pairing
original url:
https://en.wikipedia.org/wiki/Harmonious_coloring
date created:
date modified:
2023-05-03T08:19:31Z
main entity:
{"identifier":"Q5659354","url":"https://www.wikidata.org/entity/Q5659354"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/7/73/Harmonious_coloring_tree.svg","width":300,"height":300}
fields total:
13
integrity:
15