Pages that link to "Item:Q2497501"

The following pages link to A survey on labeling graphs with a condition at distance two (Q2497501):

Displaying 50 items.

• \(L(2, 1)\)-labeling of circulant graphs (Q1630932) (← links)
• Pair \(L(2, 1)\)-labelings of infinite graphs (Q1630941) (← links)
• \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs (Q1653937) (← links)
• \(L(j,k)\)-labeling numbers of square of paths (Q1680886) (← links)
• Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs (Q1752619) (← links)
• On \(L(2,1)\)-labeling of generalized Petersen graphs (Q1928525) (← links)
• Weighted improper colouring (Q1932354) (← links)
• Group path covering and distance two labeling of graphs (Q1944096) (← links)
• On the \(L(2,1)\)-labelings of amalgamations of graphs (Q1949093) (← links)
• Radio number for total graph of paths (Q1952708) (← links)
• Distance two edge labelings of lattices (Q1956249) (← links)
• \((p,q)\)-total labeling of complete graphs (Q1956251) (← links)
• Lambda number for the direct product of some family of graphs (Q2012884) (← links)
• Multiple \(L(j,1)\)-labeling of the triangular lattice (Q2015807) (← links)
• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666) (← links)
• Lambda number of the power graph of a finite group (Q2038885) (← links)
• On \(L(2 , 1)\)-labelings of oriented graphs (Q2062670) (← links)
• Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures (Q2079984) (← links)
• A note on the \(L (2, 1)\)-labelling problem of \(\mathcal{G} (k, m)\) (Q2081493) (← links)
• On \(L(2,1)\)-labelings of some products of oriented cycles (Q2144165) (← links)
• \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs (Q2181256) (← links)
• Optimal radio labellings of block graphs and line graphs of trees (Q2235749) (← links)
• On \((p, 1)\)-total labelling of NIC-planar graphs (Q2239035) (← links)
• On a distance-constrained graph labeling to model cooperation (Q2243133) (← links)
• Anti-\(k\)-labeling of graphs (Q2286097) (← links)
• On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice (Q2343988) (← links)
• 2-distance colorings of some direct products of paths and cycles (Q2346336) (← links)
• \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs (Q2352348) (← links)
• Radio number for the product of a path and a complete graph (Q2352358) (← links)
• Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees (Q2364083) (← links)
• The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs (Q2370433) (← links)
• A linear time algorithm for \(L(2,1)\)-labeling of trees (Q2375957) (← links)
• An extremal problem on non-full colorable graphs (Q2384400) (← links)
• \(L(j, k)\)-number of direct product of path and cycle (Q2391993) (← links)
• Further results on the radio number of trees (Q2413341) (← links)
• Radio number for middle graph of paths (Q2413342) (← links)
• Labeling matched sums with a condition at distance two (Q2430056) (← links)
• Circular \(L(j,k)\)-labeling number of direct product of path and cycle (Q2444141) (← links)
• On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice (Q2445232) (← links)
• \(L(2,1)\)-labeling of oriented planar graphs (Q2446298) (← links)
• Path covering number and \(L(2,1)\)-labeling number of graphs (Q2446849) (← links)
• On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs (Q2457022) (← links)
• \(L(1, 2)\)-edge-labelings for lattices (Q2514965) (← links)
• \( L ( p , q )\)-labelings of subdivisions of graphs (Q2659077) (← links)
• On the universality and extremality of graphs with a distance constrained colouring (Q2674369) (← links)
• The lambda number of the power graph of a finite \(p\)-group (Q2688248) (← links)
• <i>L</i>(<i>h</i>,<i>k</i>)-labelling for octagonal grid (Q2804024) (← links)
• Distance three labellings for <i>K</i> _<i>n</i>×<i>K</i> ₂ (Q2855724) (← links)
• Optimal L(j,k)-Edge-Labeling of Regular Grids (Q2947806) (← links)
• The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 (Q3000498) (← links)