Uniquely colorable graph
id:
uniquely-colorable-graph-278-17300586
title:
Uniquely colorable graph
text:
In graph theory, a uniquely colorable graph is a k-chromatic graph that has only one possible (proper) k-coloring up to permutation of the colors. Equivalently, there is only one way to partition its vertices into k independent sets and there is no way to partition them into k − 1 independent sets.
brand slug:
wiki
category slug:
encyclopedia
description:
Graph with only one possible coloring
original url:
https://en.wikipedia.org/wiki/Uniquely_colorable_graph
date created:
date modified:
2023-05-03T05:57:40Z
main entity:
{"identifier":"Q7886960","url":"https://www.wikidata.org/entity/Q7886960"}
image:
fields total:
13
integrity:
14