A rainbow about \(T\)-colorings for complete graphs (Q1918544): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q587976 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Jozef Fiamčik / rank | |||
Normal rank | |||
Revision as of 11:20, 16 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A rainbow about \(T\)-colorings for complete graphs |
scientific article |
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
