Keywords

#equitable_coloring

Equitable coloring

Concept in graph theory

In graph theory, an area of mathematics, an equitable coloring is an assignment of colors to the vertices of an undirected graph, in such a way thatNo two adjacent vertices have the same color, and The numbers of vertices in any two color classes differ by at most one.

Tue 16th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Equitable coloring Graph coloring Turán graph Brooks' theorem Edge coloring Interval edge coloring List of conjectures by Paul Erdős András Hajnal Cobalt Gemstone
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.