Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,788,139 papers from all fields of science
Search
Sign In
Create Free Account
Graph coloring
Known as:
Graph coloring algorithm
, Mycielski's theorem
, K-coloring
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
B-coloring
Branch and bound
Branch and price
Breadth-first search
Expand
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Distributed Algorithms for Approximating Wireless Network Capacity
M. Dinitz
Proceedings IEEE INFOCOM
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…
Expand
Highly Cited
2009
Highly Cited
2009
Synthesis and characterization of new environmentally benign tantalum-doped Ce0.8Zr0.2O2 yellow pigments: Applications in coloring of plastics
V. Vishnu
,
Giable George
,
V. Divya
,
M. Reddy
2009
Corpus ID: 55281434
Highly Cited
2006
Highly Cited
2006
Distributed localization using noisy distance and angle information
A. Basu
,
Jie Gao
,
Joseph S. B. Mitchell
,
Girishkumar Sabhnani
ACM Interational Symposium on Mobile Ad Hoc…
2006
Corpus ID: 608653
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of…
Expand
Highly Cited
2003
Highly Cited
2003
Modeling and formal verification of embedded systems based on a Petri net representation
L. Cortés
,
P. Eles
,
Zebo Peng
Journal of systems architecture
2003
Corpus ID: 13280070
Review
1997
Review
1997
Adaptive refinement of unstructured finite-element meshes
Mark T. Jones
,
P. Plassmann
1997
Corpus ID: 2343550
Review
1994
Review
1994
Some Reflections On The Interference Channel
E. C. Meulen
1994
Corpus ID: 61100826
This paper provides a short overview of the advances on the interference channel, which is a well-known channel in multiuser…
Expand
Review
1989
Review
1989
Heuristics for graph coloring
D. Werra
1989
Corpus ID: 118224077
Heuristics for Graph Coloring. Some sequential coloring techniques are reviewed. A few general principles for designing…
Expand
Highly Cited
1989
Highly Cited
1989
A general approach to nonlinear FE computations on shared-memory multiprocessors
C. Farhat
,
Luis Crivelli
1989
Corpus ID: 61029145
Review
1987
Review
1987
Fitting Cosines: Some Procedures and Some Physical Examples
D. Brillinger
1987
Corpus ID: 115697293
The paper is concerned with a variety of time series models that in some sense lead to the fitting of a cosine function of…
Expand
Highly Cited
1985
Highly Cited
1985
Graph-encoded 3-manifolds
S. Lins
,
Arnaldo Mandel
Discrete Mathematics
1985
Corpus ID: 6158688
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE