: Mathématiques: graph coloring

graph theory > fractional coloring > graph coloring

graph 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 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 are of the same color; this is called a vertex coloring. Similarly, an edge coloring assigns a color to each edge so that no two adjacent edges are of 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 have the same color.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Graph_coloring)

http://data.loterre.fr/ark:/67375/PSR-C8RTRDQK-F

RDF/XML TURTLE JSON-LD Dernière modification le 18/10/2024

Loterre