graph coloring


Also found in: Wikipedia.

graph coloring

References in periodicals archive ?
An exposition of graph coloring is followed by the relevance of graph theory to particular mathematical subfields: algebraic graph theory, topological graph theory, and analytic graph theory.
The Application of a Graph Coloring Method to an Examination Scheduling Problem.
In the first part, he explains trees and bipartite graphs, chordal graphs, planar graphs, graph coloring, and traversals and flows.
Keywords: graph coloring, circular coloring, weighted graphs
Poster presentations considered ways to test robotic performance and understand how to design algorithms for graph coloring.
Recently, graph coloring techniques used by the optimization community for sparse Jacobian and Hessian approximations [6, 7, 15, 16, 20] have been adapted to allow the approximation of any matrix, so long as the sparsity pattern is known a priori [8].
Section 1 is devoted to algorithms and infrastructures, with chapters on topics such as self-stabilizing graph coloring algorithms, and distributed service programming and interoperability.
Coverage progresses from basic definitions and concepts through trees and bipartite graphs, chordal graphs, graph coloring, and graph traversals and flows.
n, m] has led many researchers to consider the more approachable, but considerably less natural, planted distribution, pioneered by Kucera [18] in the context of graph coloring.
This also provides a rigorous evidence for the usefulness of the message passing paradigm for the graph coloring problem.
Graph colorings, spaces of edges and spaces of circuits.
This text introduces graph theory with a coloring theme, exploring connections between major topics and emerging issues in graph theory and graph colorings.