Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,209,827 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.
2013
2013
Agreement Reflexes of Emerging Optionality in Heritage Speaker Spanish.
Diego Pascual Y. Cabo
2013
Corpus ID: 63555378
2013
2013
Need to Update of Irrigation and Water Resources Information According to the Progresses of Agricultural Knowledge
M. Valipour
2013
Corpus ID: 61319758
The role of the farmer changes from season to season. Like the fields they plant or the livestock they raise, no season, and no…
Expand
2010
2010
DDRC: Data Dissemination in Vehicular Networks Using Rateless Codes
Mohsen Sardari
,
F. Hendessi
,
F. Fekri
Journal of information science and engineering
2010
Corpus ID: 14247422
In this paper, we address the problem of delivering multimedia content to a sparse vehicular network from roadside info-stations…
Expand
2009
2009
Compiler-directed scratchpad memory management via graph coloring
Lian Li
,
Hui Feng
,
Jingling Xue
TACO
2009
Corpus ID: 8475023
Scratchpad memory (SPM), a fast on-chip SRAM managed by software, is widely used in embedded systems. This article introduces a…
Expand
2008
2008
Improving the Color Stability of Wood-Plastic Composites Through Fiber Pre-Treatment
N. Stark
,
S. Mueller
2008
Corpus ID: 37636709
Wood-plastic composites (WPCs) continue to make inroads into the decking market. One of the main drawbacks from the consumer's…
Expand
2004
2004
Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks
S. Parthasarathy
,
Rajiv Gandhi
2004
Corpus ID: 16753570
We present the first distributed algorithms for computing connected dominating sets (CDS) for ad hoc networks that break the…
Expand
Review
2004
Review
2004
Partitioning Networks by Eigenvectors
A. Seary
,
William Richards
2004
Corpus ID: 118236271
A survey of published methods for partitioning sparse arrays is presented. These include early attempts to describe the…
Expand
1994
1994
A Fast Selection Algorithm for Meshes with Multiple Broadcasting
D. Bhagavathi
,
P. Looges
,
S. Olariu
,
J. Schwing
,
Jingyuan Zhang
IEEE Trans. Parallel Distributed Syst.
1994
Corpus ID: 16872416
One of the fundamental algorithmic problems in computer science involves selecting the kth smallest element in a collection A of…
Expand
1973
1973
An Algorithm for Determining the Chromatic Number of a Graph
D. Corneil
,
B. P. Graham
SIAM journal on computing (Print)
1973
Corpus ID: 33820815
A heuristic algorithm for the determination of the chromatic number of a finite graph is presented. This algorithm is based on…
Expand
Review
1965
Review
1965
Mouth Color of Nestling Passerines and Its Use in Taxonomy
M. Ficken
1965
Corpus ID: 56397945
M OUTH color has received little attention as a taxonomic character although tongue and palatal markings of nestlings have proved…
Expand