تعريف graph coloring في الإنجليزية الإنجليزية القاموس.
In graph theory, graph coloring is an assignment of "colors" to certain objects in a graph subject to certain constraints. In its simplest form, it is a way of coloring the vertices of a graph such that no two adjacent vertices share the same color, called a vertex coloring. Similarly, an edge coloring assigns a color to each edge so that no two incident edges share the same color, and a face coloring of a planar graph assigns a color to each face or region so that no two faces that share a boundary share the same color