On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path (Q1005229): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Distance-two labelings of digraphs / 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: The $L(2,1)$-Labeling Problem on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-two labelings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity of \(\lambda\)-labelings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4863434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized Petersen graphs labeled with a condition at distance two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Regular Graphs Optimally Labeled with a Condition at Distance Two / 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: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph labeling and radio channel assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(L(2,1)\)-labelings of Cartesian products of paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity and circular distance two labellings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling Chordal Graphs: Distance Two Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(2,1)\)-labelings of Cartesian products of two cycles / 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: Labelling graphs with the circular difference / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge span of distance two labellings of graphs / rank
 
Normal rank

Revision as of 02:46, 29 June 2024

scientific article
Language Label Description Also known as
English
On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
scientific article

    Statements

    On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path (English)
    0 references
    0 references
    0 references
    9 March 2009
    0 references
    \(k-L(d,1)\)-labeling
    0 references
    Cartesian product
    0 references
    path
    0 references
    cycle
    0 references
    power
    0 references
    chromatic number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers