On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs (Q5963630): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Weighted improper colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for  -Colorings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / 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: Q2846633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) / 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: Recent progress in mathematics and engineering on optimal graph labellings with distance conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity of \(\lambda\)-labelings / 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: On Moore Graphs with Diameters 2 and 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees / 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: Star matching and distance two labelling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity and circular distance two labellings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank

Latest revision as of 11:02, 11 July 2024

scientific article; zbMATH DE number 6544318
Language Label Description Also known as
English
On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs
scientific article; zbMATH DE number 6544318

    Statements

    On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs (English)
    0 references
    0 references
    23 February 2016
    0 references
    \(L(2,1)\)-labeling
    0 references
    \((s,t)\)-relaxed \(L(2,1)\)-labeling
    0 references
    path covering
    0 references
    breaking path covering
    0 references
    \(t\)-star matching
    0 references

    Identifiers