\(T\)-colorings of graphs: recent results and open problems (Q1182897): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Optimal assignment of broadcasting frequencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numbered complete graphs, unusual rulers, and assorted applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List-colourings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth problem and operations on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Semiorders and Double Indifference Graphs / rank
 
Normal rank
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: Q3340907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Representations of Multiple Semiorders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pair Labellings with Given Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3663348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space graphs and sphericity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3924236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Asymptotic Approach to the Channel Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Results on T-Coloring and Frequency Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-hole 2-distant colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: No-hole \((r+1)\)-distant colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: n-tuple colorings and associated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List \(T\)-colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3487366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284044 / rank
 
Normal rank

Revision as of 14:34, 15 May 2024

scientific article
Language Label Description Also known as
English
\(T\)-colorings of graphs: recent results and open problems
scientific article

    Statements

    \(T\)-colorings of graphs: recent results and open problems (English)
    0 references
    28 June 1992
    0 references
    \(T\)-colorings of graphs
    0 references
    channel assignment problem
    0 references
    interference graph
    0 references
    \(T\)-chromatic number
    0 references
    \(\gamma\)-perfect graph
    0 references
    greedy algorithm
    0 references
    chordal graph
    0 references
    0 references

    Identifiers