On \(L(d,1)\)-labelings of graphs
From MaRDI portal
Publication:1567607
DOI10.1016/S0012-365X(99)00400-8zbMath0954.05041OpenAlexW2058787498MaRDI QIDQ1567607
Publication date: 29 January 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00400-8
Related Items (61)
\(L(p,q)\) labeling of \(d\)-dimensional grids ⋮ Optimal channel assignment and \(L(p,1)\)-labeling ⋮ An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees ⋮ A linear time algorithm for \(L(2,1)\)-labeling of trees ⋮ The \(L(2,1)\)-labeling on planar graphs ⋮ Distance-two labelings of digraphs ⋮ Backbone coloring for graphs with large girths ⋮ \(L(p,2,1)\)-labeling of the infinite regular trees ⋮ L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs ⋮ Distance Constrained Labelings of Trees ⋮ The \((p,q)\)-total labeling problem for trees ⋮ Group path covering and \(L(j,k)\)-labelings of diameter two graphs ⋮ Distance three labelings of trees ⋮ An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees ⋮ Group path covering and distance two labeling of graphs ⋮ Unitarity plus causality implies localizability ⋮ List backbone colouring of graphs ⋮ Unnamed Item ⋮ Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs ⋮ On theL(2, 1)-labelling of block graphs ⋮ Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube ⋮ Labeling planar graphs with a condition at distance two ⋮ \((2,1)\)-total labelling of outerplanar graphs ⋮ The \(L(2,1)\)-labeling on the skew and converse skew products of graphs ⋮ Labelling planar graphs without 4-cycles with a condition on distance two ⋮ \((p,1)\)-total labelling of graphs ⋮ Radio number for trees ⋮ Recent progress in mathematics and engineering on optimal graph labellings with distance conditions ⋮ The \(L(2,1)\)-labeling on Cartesian sum of graphs ⋮ The \(L(2,1)\)-labeling on graphs and the frequency assignment problem ⋮ On the \(L(p,1)\)-labelling of graphs ⋮ Injective coloring of planar graphs ⋮ Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks ⋮ Distance constrained labelings of planar graphs with no short cycles ⋮ Graph labellings with variable weights, a survey ⋮ \(L(j,k)\)-labelling and maximum ordering-degrees for trees ⋮ A note on collections of graphs with non-surjective lambda labelings ⋮ The \(L(2,1)\)-labelling of trees ⋮ The \(L(h,1,1)\)-labelling problem for trees ⋮ \(L(2,1)\)-labelings of Cartesian products of two cycles ⋮ On critical trees labeled with a condition at distance two ⋮ On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs ⋮ A survey on labeling graphs with a condition at distance two ⋮ \(L(2,1)\)-labelings on the composition of \(n\) graphs ⋮ L(1,1)-Labeling of direct product of cycles ⋮ Labeling graphs with two distance constraints ⋮ \(L(p,q)\)-labeling and integer tension of a graph embedded on torus ⋮ The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications ⋮ On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path ⋮ Linear and cyclic distance-three labellings of trees ⋮ \(L(h,k)\)-labelings of Hamming graphs ⋮ A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes ⋮ The \(L(d,1)\)-number of powers of paths ⋮ \(L(p,q)\)-labeling of digraphs ⋮ On \(L(2,1)\)-labelings of Cartesian products of paths and cycles ⋮ Some results on distance two labelling of outerplanar graphs ⋮ Distance constrained labelings of \(K_{4}\)-minor free graphs ⋮ Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs ⋮ Distance-two labelings of graphs ⋮ Optimal \(L(3, 2, 1)\)-labeling of triangular lattice ⋮ List version of \(L(d,s)\)-labelings
This page was built for publication: On \(L(d,1)\)-labelings of graphs
