Distinguishing coloring
id:
distinguishing-coloring-251-12865230
title:
Distinguishing coloring
text:
In graph theory, a distinguishing coloring or distinguishing labeling of a graph is an assignment of colors or labels to the vertices of the graph that destroys all of the nontrivial symmetries of the graph. The coloring does not need to be a proper coloring: adjacent vertices are allowed to be given the same color. For the colored graph, there should not exist any one-to-one mapping of the vertices to themselves that preserves both adjacency and coloring. The minimum number of colors in a disti
brand slug:
wiki
category slug:
encyclopedia
description:
Assignment of colors to graph vertices that destroys all symmetries
original url:
https://en.wikipedia.org/wiki/Distinguishing_coloring
date created:
date modified:
2023-11-08T16:19:04Z
main entity:
{"identifier":"Q25304053","url":"https://www.wikidata.org/entity/Q25304053"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/d9/Distinguishing_4-hypercube.svg","width":320,"height":317}
fields total:
13
integrity:
15