Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two (Q741539): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the \(L(2,1)\)-labelings of amalgamations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Products of Complete Graphs with a Condition at Distance Two / 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: On the \(L(p,1)\)-labelling of graphs / 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: Griggs and Yeh's Conjecture and $L(p,1)$-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling outerplanar graphs with maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path covering number and \(L(2,1)\)-labeling number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2,1)\)-labelings on the modular product of two graphs / 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 00:41, 9 July 2024

scientific article
Language Label Description Also known as
English
Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two
scientific article

    Statements

    Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 September 2014
    0 references
    \(L(2,1)\)-labeling
    0 references
    distance-two labeling
    0 references
    amalgamation
    0 references
    Cartesian product
    0 references
    minimum makespan scheduling
    0 references

    Identifiers