Pages that link to "Item:Q2476282"

The following pages link to On the \(L(p,1)\)-labelling of graphs (Q2476282):

Displaying 44 items.

• \(L(2,1)\)-labelings on the modular product of two graphs (Q387006) (← links)
• Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips (Q412338) (← links)
• \(L(2,1)\)-labelling of generalized prisms (Q415277) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• The minimum span of \(L(2,1)\)-labelings of generalized flowers (Q479033) (← links)
• \(L(2,1)\)-labeling of interval graphs (Q500005) (← links)
• \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs (Q512552) (← 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)
• \(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028) (← links)
• Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two (Q741539) (← links)
• Linear and cyclic distance-three labellings of trees (Q741540) (← links)
• The \(L(p, q)\)-labelling of planar graphs without 4-cycles (Q741764) (← links)
• \(L(0,1)\)-labelling of permutation graphs (Q894561) (← links)
• Labeling the \(r\)-path with a condition at distance two (Q967377) (← links)
• Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
• The List \(L(2, 1)\)-labeling of planar graphs (Q1637136) (← links)
• \(L(2,1)\)-labeling for subdivisions of cycle dominated graphs (Q1653937) (← links)
• \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s (Q1751152) (← links)
• Some results on the injective chromatic number of graphs (Q1928520) (← links)
• On \(L(2,1)\)-labeling of generalized Petersen graphs (Q1928525) (← links)
• On the \(L(2,1)\)-labelings of amalgamations of graphs (Q1949093) (← links)
• The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups (Q1956236) (← links)
• \(L(p,q)\)-labeling of sparse graphs (Q1956243) (← links)
• On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs (Q2012895) (← links)
• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs (Q2018666) (← links)
• The list \(L(2,1)\)-labeling of planar graphs with large girth (Q2039710) (← links)
• Distance two surjective labelling of paths and interval graphs (Q2045355) (← links)
• Optimal frequency assignment and planar list \(L(2, 1)\)-labeling (Q2084641) (← links)
• \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs (Q2181256) (← links)
• Computing \(L(p, 1)\)-labeling with combined parameters (Q2232248) (← links)
• Anti-\(k\)-labeling of graphs (Q2286097) (← links)
• \( L ( 2 , 1 )\)-labeling of disk intersection graphs (Q2306585) (← links)
• \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs (Q2352348) (← links)
• Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
• \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles (Q2668538) (← links)
• On the universality and extremality of graphs with a distance constrained colouring (Q2674369) (← links)
• Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs (Q4568089) (← links)
• Computing L(p,1)-Labeling with Combined Parameters (Q5049996) (← links)
• L(3,1)-labeling of circulant graphs (Q5063266) (← links)
• <i>L</i>(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs (Q5097782) (← links)
• On the<i>L</i>(2, 1)-labelling of block graphs (Q5391500) (← links)
• An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs (Q6069154) (← links)
• L(2,1,1)-labeling of interval graphs (Q6107729) (← links)