\(L(1, 2)\)-edge-labelings for lattices (Q2514965): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11766-014-3176-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983164350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for  -Colorings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387672 / 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(h,1)\)-labeling subclasses of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2846633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5475521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real Number Channel Assignments for Lattices / 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: 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: Graph distance‐dependent labeling related to code assignment in computer networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance two edge labelings of lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:15, 9 July 2024

scientific article
Language Label Description Also known as
English
\(L(1, 2)\)-edge-labelings for lattices
scientific article

    Statements

    \(L(1, 2)\)-edge-labelings for lattices (English)
    0 references
    0 references
    0 references
    11 February 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \(L(j, k)\)-edge-labeling
    0 references
    line graph
    0 references
    triangular lattice
    0 references
    square lattice
    0 references
    hexagonal lattice
    0 references
    0 references