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.
Review
2020
Review
2020
One of the major challenges that autonomous cars are facing today is driving in urban environments. To make it a reality… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2019
Review
2019
Traffic classification has been studied for two decades and applied to a wide range of applications from QoS provisioning and… Expand
  • figure 1
  • table 1
  • table 2
Is this relevant?
Review
2019
Review
2019
Abstract Semantic segmentation is a challenging task in computer vision systems. A lot of methods have been developed to tackle… Expand
Is this relevant?
Review
2019
Review
2019
Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and studies geometric representations of… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Review
2018
Review
2018
Vortices are commonly understood as rotating motions in fluid flows. The analysis of vortices plays an important role in numerous… Expand
Is this relevant?
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
Is this relevant?
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
Is this relevant?
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
Is this relevant?
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
Is this relevant?
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
Is this relevant?