The following pages link to (Q3838194):
Displaying 50 items.
- \(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438) (← links)
- \(L(2,1)\)-labelings on the modular product of two graphs (Q387006) (← 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)
- New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q533885) (← links)
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs (Q548395) (← links)
- On critical trees labeled with a condition at distance two (Q556846) (← links)
- Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks (Q691628) (← links)
- On real number labelings and graph invertibility (Q713307) (← 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)
- Distance-two labelings of digraphs (Q881579) (← links)
- The \(L(2,1)\)-labeling on Cartesian sum of graphs (Q953888) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- Labeling the \(r\)-path with a condition at distance two (Q967377) (← links)
- \(L(j,k)\)-labelling and maximum ordering-degrees for trees (Q968198) (← links)
- The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
- Labeling graphs with two distance constraints (Q998444) (← 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 complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950) (← links)
- The \(L(d,1)\)-number of powers of paths (Q1025974) (← links)
- \(L(p,q)\)-labeling of digraphs (Q1026134) (← links)
- Distance-two labellings of Hamming graphs (Q1026152) (← links)
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
- Greedy \(F\)-colorings of graphs (Q1415540) (← links)
- \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) (← 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)
- \((p,q)\)-total labeling of complete graphs (Q1956251) (← links)
- Lambda number of the power graph of a finite group (Q2038885) (← links)
- Distance two surjective labelling of paths and interval graphs (Q2045355) (← links)
- Distance-constrained labellings of Cartesian products of graphs (Q2231783) (← links)
- On a distance-constrained graph labeling to model cooperation (Q2243133) (← links)
- Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers (Q2253966) (← links)
- \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs (Q2352348) (← links)
- \(L(j, k)\)-number of direct product of path and cycle (Q2391993) (← links)
- \(L(2, 1)\)-labelings of the edge-path-replacement of a graph (Q2392735) (← links)
- \(L(2,1)\)-labelings of some families of oriented planar graphs (Q2442267) (← links)
- The \(L(2,1)\)-labeling on the skew and converse skew products of graphs (Q2463926) (← links)
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions (Q2471056) (← links)
- \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs (Q2471059) (← links)
- The \(L(2,1)\)-labeling on graphs and the frequency assignment problem (Q2472818) (← links)
- A bound on the chromatic number of the square of a planar graph (Q2485944) (← links)
- \(L(2,1)\)-labelings of Cartesian products of two cycles (Q2492228) (← links)
