graph coloring

Graph coloring is still a very active field of research.

Many problems have to do with various ways of graph coloring, for example:

For practical applications, the mathematics of graph coloring are too slow.

Tree-depth may also be defined using a form of graph coloring.

This work introduced an efficient parallel technique for graph coloring.

The following are two of the few results about infinite graph coloring:

The textbook approach to this problem is to model it as a graph coloring problem.

Much research about triangle-free graphs has focused on graph coloring.

Edge colorings are one of several different types of graph coloring.

Graph coloring allocators produce efficient code, but their allocation time is high.

Solving Sudoku puzzles can be expressed as a graph coloring problem.

Pseudoforests also play a key role in parallel algorithms for graph coloring and related problems.

By definition, a trace diagram's function is computed using signed graph coloring.

Graph coloring enjoys many practical applications as well as theoretical challenges.

How many graph colorings using k colors are there for a particular graph G?

The most notable application of topological combinatorics has been to graph coloring problems.

It is a generalization of ordinary graph coloring.

He is responsible for a well-known approximation algorithm for graph coloring.

A paper with Erdős on graph coloring problems for infinite graphs and hypergraphs.

Applications of fractional graph coloring include activity scheduling.

With Michael Molloy, he is the author of a book on graph coloring and the probabilistic method.

In the field of distributed algorithms, graph coloring is closely related to the problem of symmetry breaking.

One of the major applications of graph coloring, register allocation in compilers, was introduced in 1981.

Graph coloring is computationally hard.

Fractional coloring, a linear programming relaxation of graph coloring.