Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
Tabu search techniques are used for moving step by step towards the minimum value of a function. A tabu list of forbidden… Expand
  • table 2
  • table 3
  • table 4
Highly Cited
1999
Highly Cited
1999
A recent and very promising approach for combinatorial optimization is to embed local search into the framework of evolutionary… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Highly Cited
1998
Highly Cited
1998
We consider the problem of coloring <italic>k</italic>-colorable graphs with the fewest possible colors. We present a randomized… Expand
Highly Cited
1996
Highly Cited
1996
We present a method for solving the independent set formulation of the graph coloring problem (where there is one variable for… Expand
Highly Cited
1994
Highly Cited
1994
Planar Graphs. Graphs on Higher Surfaces. Degrees. Critical Graphs. The Conjectures of Hadwiger and Hajos. Sparse Graphs. Perfect… Expand
Highly Cited
1991
Highly Cited
1991
This is the second in a series of three papers that empirically examine the competitiveness of simulated annealing in certain… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1990
Highly Cited
1990
Abstract Let H be a fixed graph, whose vertices are referred to as ‘colors’. An H-coloring of a graph G is an assignment of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Highly Cited
1983
Highly Cited
1983
Given a mapping with a sparse Jacobian matrix, the problem of minimizing the number of function evaluations needed to estimate… Expand
  • figure 2.1
  • figure 2.2
  • figure 3.1
  • figure 3.2
  • figure 3.3
Highly Cited
1982
Highly Cited
1982
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
  • F. Gavril
  • SIAM J. Comput.
  • 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
  • figure 2
  • figure 4