Preprint
Aug 2026
Greedy-Like Defective Coloring: Distributed Algorithms and Applications
It is proved that if the number of colors $c$ is not a perfect square, the state-of-the-art defect for distributed $c-colorings by a constant factor in most cases can be improved.
Marc Fuchs, Fabian Kuhn
· 0 citations