Skip to search formSkip to main contentSkip to account menu

Graph coloring

Known as: Graph coloring algorithm, Mycielski's theorem, K-coloring 
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
  • M. Dinitz
  • 2010
  • Corpus ID: 11366805
In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol… 
Highly Cited
2006
Highly Cited
2006
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of… 
Review
1994
Review
1994
This paper provides a short overview of the advances on the interference channel, which is a well-known channel in multiuser… 
Review
1989
Review
1989
Heuristics for Graph Coloring. Some sequential coloring techniques are reviewed. A few general principles for designing… 
Review
1987
Review
1987
The paper is concerned with a variety of time series models that in some sense lead to the fitting of a cosine function of… 
Highly Cited
1985