A rainbow about \(T\)-colorings for complete graphs (Q1918544)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 906896
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A rainbow about \(T\)-colorings for complete graphs |
scientific article; zbMATH DE number 906896 |
Statements
A rainbow about \(T\)-colorings for complete graphs (English)
0 references
25 November 1996
0 references
By a \(T\)-colouring of a graph \(G= (V, E)\) we mean a function \(f: V\to N_0\) such that \(|f(x)- f(y)|\) does not belong to \(T\) for each \(xy\in E\), where \(T\) is a finite set of positive integers with 0. \(T\)-span of \(G\) is the minimum span over all \(T\)-colourings of \(G\). The \(T\)-span of a complete graph is shown to be NP-complete.
0 references
rainbow
0 references
\(T\)-colouring
0 references
\(T\)-span
0 references
complete graph
0 references
0 references
0 references
0 references
0.9206093
0 references
0.91807663
0 references
0.9159173
0 references
0.9146837
0 references
