Radio k-chromatic number of cycles for large k (Q5367524): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Nathaniel J. Karst / rank
Normal rank
 
Property / author
 
Property / author: Nathaniel J. Karst / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio labelings of distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio antipodal colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio k-colorings of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radio number for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating path coverings to vertex labellings with a condition at distance two / 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: Q4897468 / 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: Radio k-labelings for Cartesian products of graphs / 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: Multilevel Distance Labelings for Paths and Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antipodal number of some powers of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for radio \(k\)-chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On characterizing radio \(k\)-coloring problem by path covering problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s1793830917500318 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2594431613 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:21, 30 July 2024

scientific article; zbMATH DE number 6794894
Language Label Description Also known as
English
Radio k-chromatic number of cycles for large k
scientific article; zbMATH DE number 6794894

    Statements

    Radio k-chromatic number of cycles for large k (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 October 2017
    0 references
    radio \(k\)-labeling
    0 references
    radio labeling
    0 references
    radio antipodal labeling
    0 references
    multilevel distance labeling
    0 references

    Identifiers