The following pages link to On \(L(d,1)\)-labelings of graphs (Q1567607):
Displayed 50 items.
- Backbone coloring for graphs with large girths (Q385734) (← links)
- \(L(p,2,1)\)-labeling of the infinite regular trees (Q393463) (← links)
- The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
- Group path covering and \(L(j,k)\)-labelings of diameter two graphs (Q413258) (← links)
- Distance three labelings of trees (Q415278) (← links)
- Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube (Q489710) (← links)
- On critical trees labeled with a condition at distance two (Q556846) (← links)
- Unitarity plus causality implies localizability (Q632800) (← links)
- Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks (Q691628) (← links)
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs (Q714037) (← links)
- Linear and cyclic distance-three labellings of trees (Q741540) (← links)
- List version of \(L(d,s)\)-labelings (Q817777) (← links)
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
- The \(L(2,1)\)-labeling on planar graphs (Q868019) (← links)
- Distance-two labelings of digraphs (Q881579) (← links)
- Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q930929) (← links)
- Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
- The \(L(2,1)\)-labeling on Cartesian sum of graphs (Q953888) (← links)
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- \(L(j,k)\)-labelling and maximum ordering-degrees for trees (Q968198) (← links)
- The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
- \(L(2,1)\)-labelings on the composition of \(n\) graphs (Q986562) (← links)
- Labeling graphs with two distance constraints (Q998444) (← links)
- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications (Q1003574) (← links)
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path (Q1005229) (← links)
- \(L(h,k)\)-labelings of Hamming graphs (Q1025475) (← links)
- A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes (Q1025490) (← links)
- The \(L(d,1)\)-number of powers of paths (Q1025974) (← links)
- \(L(p,q)\)-labeling of digraphs (Q1026134) (← links)
- Some results on distance two labelling of outerplanar graphs (Q1036889) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
- A note on collections of graphs with non-surjective lambda labelings (Q1765378) (← links)
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles (Q1827783) (← links)
- Distance-two labelings of graphs (Q1869030) (← links)
- Group path covering and distance two labeling of graphs (Q1944096) (← links)
- Optimal \(L(3, 2, 1)\)-labeling of triangular lattice (Q2357158) (← links)
- \(L(p,q)\) labeling of \(d\)-dimensional grids (Q2370453) (← links)
- A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)
- List backbone colouring of graphs (Q2440098) (← links)
- Labeling planar graphs with a condition at distance two (Q2461777) (← links)
- \((2,1)\)-total labelling of outerplanar graphs (Q2462398) (← links)
- The \(L(2,1)\)-labeling on the skew and converse skew products of graphs (Q2463926) (← links)
- \((p,1)\)-total labelling of graphs (Q2467731) (← links)
- Radio number for trees (Q2469993) (← links)
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions (Q2471056) (← links)
- The \(L(2,1)\)-labeling on graphs and the frequency assignment problem (Q2472818) (← links)
- On the \(L(p,1)\)-labelling of graphs (Q2476282) (← links)
- The \(L(2,1)\)-labelling of trees (Q2489954) (← links)