Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees (Q2364083): 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: \(L(3,2,1)\)-labeling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance three labelings of trees / 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: L(2,1,1)-Labeling Is NP-Complete for Trees / 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: A Linear Time Algorithm for L(2,1)-Labeling of Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance three labelings for direct products of three complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(L(h,1,1)\)-labelling problem for trees / 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: A distance-labelling problem for hypercubes / rank
 
Normal rank

Latest revision as of 04:04, 14 July 2024

scientific article
Language Label Description Also known as
English
Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
scientific article

    Statements