Graph coloring
id:
graph-coloring-166-997847
title:
Graph coloring
text:
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 assign
brand slug:
wiki
category slug:
encyclopedia
description:
Methodic assignment of colors to elements of a graph
original url:
https://en.wikipedia.org/wiki/Graph_coloring
date created:
2004-01-10T22:06:49Z
date modified:
2024-08-29T16:56:28Z
main entity:
{"identifier":"Q504843","url":"https://www.wikidata.org/entity/Q504843"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/9/90/Petersen_graph_3-coloring.svg","width":469,"height":457}
fields total:
13
integrity:
16