Pages that link to "Item:Q2492228"
From MaRDI portal
The following pages link to \(L(2,1)\)-labelings of Cartesian products of two cycles (Q2492228):
Displaying 39 items.
- Backbone coloring for graphs with large girths (Q385734) (← links)
- \(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438) (← links)
- The minimum span of \(L(2,1)\)-labelings of generalized flowers (Q479033) (← links)
- \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs (Q512552) (← links)
- \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle (Q514887) (← links)
- Coloring the square of the Cartesian product of two cycles (Q708380) (← links)
- Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two (Q741539) (← links)
- (2,1)-total labelling of trees with sparse vertices of maximum degree (Q976073) (← links)
- \(L(2,1)\)-labelings on the composition of \(n\) graphs (Q986562) (← links)
- Connectivity of Cartesian products of graphs (Q998569) (← links)
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path (Q1005229) (← links)
- Distance-two labellings of Hamming graphs (Q1026152) (← links)
- \(L(2,1)\)-labeling of direct product of paths and cycles (Q1764815) (← links)
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles (Q1827783) (← links)
- Drawings of \(C_m\times C_n\) with one disjoint family. II (Q1850541) (← links)
- On the \(L(2,1)\)-labelings of amalgamations of graphs (Q1949093) (← links)
- Lambda number for the direct product of some family of graphs (Q2012884) (← links)
- Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs (Q2077391) (← links)
- On \(L(2,1)\)-labelings of some products of oriented cycles (Q2144165) (← links)
- 2-distance colorings of some direct products of paths and cycles (Q2346336) (← links)
- The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs (Q2370433) (← links)
- \(L(2, 1)\)-labelings of the edge-path-replacement of a graph (Q2392735) (← links)
- \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs (Q2413382) (← links)
- List backbone colouring of graphs (Q2440098) (← links)
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles (Q2576352) (← links)
- Optimal \(L(2,1)\)-labeling of Cartesian products of cycles, with an application to independent domination (Q2724308) (← links)
- \(L(1,1)\)-labeling of direct product of cycles (Q2798315) (← links)
- <i>L</i>(<i>h</i>,<i>k</i>)-labelling for octagonal grid (Q2804024) (← links)
- On \(L(d,1)\)-labelings of the Cartesian product of two cycles. (Q2823198) (← links)
- On some results for the \(L(2,1)\)-labeling on Cartesian sum graphs. (Q2828921) (← links)
- <i>L</i>(2, 1)-labellings for direct products of a triangle and a cycle (Q2852105) (← links)
- Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment] (Q4540142) (← links)
- On irreducible no-hole <i>L</i>(2, 1)-coloring of Cartesian product of trees with paths (Q4956226) (← links)
- THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE (Q5016312) (← links)
- (Q5037233) (← links)
- DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE (Q5217048) (← links)
- \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph (Q5963629) (← links)
- \(L(2,1)\)-labeling for brick product graphs (Q5963632) (← links)
- n-fold L(2, 1)-labelings of Cartesian product of paths and cycles (Q6497036) (← links)