# Weak graph colorings: distributed algorithms and applications

@inproceedings{Kuhn2009WeakGC, title={Weak graph colorings: distributed algorithms and applications}, author={F. Kuhn}, booktitle={SPAA '09}, year={2009} }

We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a color class may induce a graph of maximum degree d for some parameter d>0. We also look at colorings where a minimum number of multi-chromatic edges is required. For an integer k>0, we call a coloring k-partially proper if every node v has at least min{k,deg(v)} neighbors with a different color. We show that for all d∈{1… CONTINUE READING

#### Topics from this paper.

109 Citations

A new technique for distributed symmetry breaking

- Computer Science, Mathematics
- 2010

- 88
- Highly Influenced
- PDF

Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching

- Computer Science, Mathematics
- 2017

- 40
- PDF

Distributed deterministic edge coloring using bounded neighborhood independence

- Engineering, Computer Science
- 2011

- 27
- Highly Influenced
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-4 OF 4 REFERENCES

Distributed (δ+1)-coloring in linear (in δ) time

- Computer Science, Mathematics
- 2009

- 131
- Highly Influential
- PDF

A simple parallel algorithm for the maximal independent set problem

- Computer Science
- 1985

- 1,076
- Highly Influential
- PDF