In graph theory, a rainbow-independent set (ISR) is an independent set in a graph, in which each vertex has a different color. Formally, let G = (V, E) be a graph, and suppose vertex set V is partitioned into m subsets V1, …, Vm, called "colors".
In graph theory, a rainbow-independent set (ISR) is an independent set in a graph, in which each vertex has a different color. Formally, let G = (V, E) be a graph, and suppose vertex set V is partitioned into m subsets V1, …, Vm, called "colors".
Source: Wikipedia "Rainbow-independent set" · CC BY-SA 4.0
Share this article: X · Bluesky