Strong coloring
id:
strong-coloring-267-11817994
title:
Strong coloring
text:
In graph theory, a strong coloring, with respect to a partition of the vertices into (disjoint) subsets of equal sizes, is a (proper) vertex coloring in which every color appears exactly once in every part. A graph is strongly k-colorable if, for each partition of the vertices into sets of size k, it admits a strong coloring. When the order of the graph G is not divisible by k, we add isolated vertices to G just enough to make the order of the new graph G′ divisible by k. In that case, a strong
brand slug:
wiki
category slug:
encyclopedia
description:
(proper) vertex coloring
original url:
https://en.wikipedia.org/wiki/Strong_coloring
date created:
date modified:
2023-06-29T05:36:06Z
main entity:
{"identifier":"Q7624545","url":"https://www.wikidata.org/entity/Q7624545"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/e/ea/Strong_coloring_sample.svg","width":1600,"height":800}
fields total:
13
integrity:
15