Pages that link to "Item:Q2706187"
From MaRDI portal
The following pages link to Labeling Products of Complete Graphs with a Condition at Distance Two (Q2706187):
Displaying 50 items.
- Coloring, location and domination of corona graphs (Q372395) (← links)
- Backbone coloring for graphs with large girths (Q385734) (← links)
- \(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438) (← links)
- Group path covering and \(L(j,k)\)-labelings of diameter two graphs (Q413258) (← links)
- \(L(2,1)\)-labelling of generalized prisms (Q415277) (← links)
- On backbone coloring of graphs (Q434190) (← links)
- The minimum span of \(L(2,1)\)-labelings of generalized flowers (Q479033) (← links)
- On critical trees labeled with a condition at distance two (Q556846) (← links)
- Coloring the square of the Cartesian product of two cycles (Q708380) (← links)
- On real number labelings and graph invertibility (Q713307) (← links)
- Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two (Q741539) (← 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)
- Distance two labelling and direct products of graphs (Q932631) (← 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)
- Optimal radio labellings of complete \(m\)-ary trees (Q968168) (← links)
- \(L(2,1)\)-labelings on the composition of \(n\) graphs (Q986562) (← links)
- A distance-labelling problem for hypercubes (Q1005224) (← 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)
- Distance-two labellings of Hamming graphs (Q1026152) (← links)
- Some results on distance two labelling of outerplanar graphs (Q1036889) (← links)
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← 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)
- Group path covering and distance two labeling of graphs (Q1944096) (← links)
- On the \(L(2,1)\)-labelings of amalgamations of graphs (Q1949093) (← links)
- Distance-constrained labellings of Cartesian products of graphs (Q2231783) (← links)
- Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers (Q2253966) (← links)
- Radio number for the product of a path and a complete graph (Q2352358) (← links)
- Extremal problems on consecutive \(L(2,1)\)-labelling (Q2370429) (← links)
- An extremal problem on non-full colorable graphs (Q2384400) (← 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)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs (Q2413382) (← links)
- List backbone colouring of graphs (Q2440098) (← 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)
- Radio number for trees (Q2469993) (← 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)
- The \(L(2,1)\)-labelling of trees (Q2489954) (← links)
- \(L(2,1)\)-labelings of Cartesian products of two cycles (Q2492228) (← links)
- A survey on labeling graphs with a condition at distance two (Q2497501) (← links)
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles (Q2576352) (← links)
- L(1,1)-Labeling of direct product of cycles (Q2798315) (← links)
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey (Q3439628) (← links)
- THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE (Q5016312) (← links)
