Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 211,175,675 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
1999
Highly Cited
1999
Hybrid Evolutionary Algorithms for Graph Coloring
P. Galinier
,
Jin-Kao Hao
Journal of combinatorial optimization
1999
Corpus ID: 7661432
A recent and very promising approach for combinatorial optimization is to embed local search into the framework of evolutionary…
Expand
Highly Cited
1998
Highly Cited
1998
Approximate graph coloring by semidefinite programming
David R Karger
,
R. Motwani
,
M. Sudan
Proceedings 35th Annual Symposium on Foundations…
1998
Corpus ID: 1143038
We consider the problem of coloring k-colorable graphs with the fewest possible colors. We give a randomized polynomial time…
Expand
Highly Cited
1994
Highly Cited
1994
Graph Coloring Problems
Tommy R. Jensen
,
B. Toft
1994
Corpus ID: 118910784
Planar Graphs. Graphs on Higher Surfaces. Degrees. Critical Graphs. The Conjectures of Hadwiger and Hajos. Sparse Graphs. Perfect…
Expand
Highly Cited
1992
Highly Cited
1992
Colorings and orientations of graphs
N. Alon
,
M. Tarsi
Comb.
1992
Corpus ID: 45528500
Bounds for the chromatic number and for some related parameters of a graph are obtained by applying algebraic techniques. In…
Expand
Highly Cited
1991
Highly Cited
1991
Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
David S. Johnson
,
C. Aragon
,
L. A. McGeoch
,
C. Schevon
Operational Research
1991
Corpus ID: 14433971
This is the second in a series of three papers that empirically examine the competitiveness of simulated annealing in certain…
Expand
Highly Cited
1987
Highly Cited
1987
Using tabu search techniques for graph coloring
A. Hertz
,
D. Werra
Computing
1987
Corpus ID: 15422946
Tabu search techniques are used for moving step by step towards the minimum value of a function. A tabu list of forbidden…
Expand
Highly Cited
1983
Highly Cited
1983
Smallest-last ordering and clustering and graph coloring algorithms
D. Matula
,
L. Beck
JACM
1983
Corpus ID: 4417741
Smallest-last vertex ordering and prlonty search are utdlzed to show for any graph G = (IT, E) that the set of all connected…
Expand
Highly Cited
1983
Highly Cited
1983
Estimation of sparse jacobian matrices and graph coloring problems
T. Coleman
,
J. J. Moré
1983
Corpus ID: 55566735
Given a mapping with a sparse Jacobian matrix, the problem of minimizing the number of function evaluations needed to estimate…
Expand
Highly Cited
1982
Highly Cited
1982
Register allocation & spilling via graph coloring
G. Chaitin
SIGPLAN Conferences and Workshops
1982
Corpus ID: 16872867
In a previous paper we reported the successful use of graph coloring techniques for doing global register allocation in an…
Expand
Highly Cited
1972
Highly Cited
1972
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
F. Gavril
SIAM journal on computing (Print)
1972
Corpus ID: 1111479
A finite undirected graph is called chordal if every simple circuit has a chord. Given a chordal graph, we present, ways for…
Expand
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