OPTIMAL RADIOCOLORING OF TREES (Q5221077): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.11568/kjm.2019.27.4.831 / 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: The $L(2,1)$-Labeling Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling trees with a condition at distance two. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(L(2,1)\)-labelling of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Radiocoloring in planar graphs: Complexity and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Square Roots of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of an outerplanar graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.11568/KJM.2019.27.4.831 / rank
 
Normal rank

Latest revision as of 17:24, 30 December 2024

scientific article; zbMATH DE number 7181597
Language Label Description Also known as
English
OPTIMAL RADIOCOLORING OF TREES
scientific article; zbMATH DE number 7181597

    Statements

    Identifiers

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