A lower bound technique for radio \(k\)-coloring (Q512555): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2765170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4665539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio k-colorings of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and cyclic radio k-labelings of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3426085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly antipodal chromatic number $ac'(P_n)$ of the path $P_n$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal radio labellings of complete \(m\)-ary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel Distance Labelings for Paths and Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on radio \(k\)-colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for radio \(k\)-chromatic number / rank
 
Normal rank

Latest revision as of 11:12, 13 July 2024

scientific article
Language Label Description Also known as
English
A lower bound technique for radio \(k\)-coloring
scientific article

    Statements

    A lower bound technique for radio \(k\)-coloring (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 February 2017
    0 references
    radio \(k\)-coloring
    0 references
    lower bound technique
    0 references
    approximation algorithm
    0 references
    regular grid graphs
    0 references
    paths
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references