: Mathématiques: fractional coloring

graph theory > fractional coloring

fractional coloring

Fractional coloring is a topic in a young branch of graph theory known as fractional graph theory. It is a generalization of ordinary graph coloring. In a traditional graph coloring, each vertex in a graph is assigned some color, and adjacent vertices — those connected by edges — must be assigned different colors. In a fractional coloring however, a set of colors is assigned to each vertex of a graph. The requirement about adjacent vertices still holds, so if two vertices are joined by an edge, they must have no colors in common.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Fractional_coloring)

http://data.loterre.fr/ark:/67375/PSR-N52QXDC8-W

RDF/XML TURTLE JSON-LD

Loterre