A rainbow about \(T\)-colorings for complete graphs (Q1918544): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3322121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal multiple interval assignments in frequency assignment and traffic phasing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-colorings of graphs: recent results and open problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: List \(T\)-colorings of graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(94)00344-i / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082504553 / rank
 
Normal rank

Latest revision as of 09:57, 30 July 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
    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

    Identifiers