\(L(j,k)\)-labelling and maximum ordering-degrees for trees (Q968198): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: \(L(h,1)\)-labeling subclasses of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-two labelings of graphs / 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: On \(L(d,1)\)-labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pair Labellings with Given Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838194 / 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: On the $\lambda$-Number of $Q_n $ and Related Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real Number Graph Labellings with Distance Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real Number Channel Assignments for Lattices / 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: Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of the square of a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Chordal Graphs: Distance Two Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank

Revision as of 18:43, 2 July 2024

scientific article
Language Label Description Also known as
English
\(L(j,k)\)-labelling and maximum ordering-degrees for trees
scientific article

    Statements

    \(L(j,k)\)-labelling and maximum ordering-degrees for trees (English)
    0 references
    0 references
    0 references
    0 references
    5 May 2010
    0 references
    channel assignment problem
    0 references
    distance-two labelling
    0 references
    trees
    0 references

    Identifiers