T-coloring
id:
t-coloring-294-10928537
title:
T-coloring
text:
In graph theory, a T-Coloring of a graph G = , given the set T of nonnegative integers containing 0, is a function c : V → N that maps each vertex to a positive integer (color) such that if u and w are adjacent then | c − c | ∉ T . In simple words, the absolute value of the difference between two colors of adjacent vertices must not belong to fixed set T. The concept was introduced by William K. Hale. If T = {0} it reduces to common vertex coloring. The T-chromatic number, χ T , is the minimum n
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/T-coloring
date created:
date modified:
2020-06-27T17:02:09Z
main entity:
{"identifier":"Q7667902","url":"https://www.wikidata.org/entity/Q7667902"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/b7/T-colorings.png","width":579,"height":233}
fields total:
13
integrity:
14