'How to find Equitable colouring of k-degenerate graph
A k-degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k. I want to find out the equitable coloring of the k-degenerate graphs. Equitable coloring is nothing but the coloring of the graph such that the maximum difference between each colour class is 1.
Any input regarding the k-degenerate graph is helpful.
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|