Pages that link to "Item:Q4863972"

The following pages link to On the $\lambda$-Number of $Q_n $ and Related Graphs (Q4863972):

Displaying 50 items.

• \((2,1)\)-total labeling of a class of subcubic graphs (Q324977) (← links)
• Backbone coloring for graphs with large girths (Q385734) (← links)
• \(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438) (← links)
• The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
• A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (Q450562) (← links)
• \(L(2,1)\)-labelings of subdivisions of graphs (Q472974) (← links)
• The minimum span of \(L(2,1)\)-labelings of generalized flowers (Q479033) (← links)
• Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube (Q489710) (← links)
• \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle (Q498455) (← links)
• On \((p,1)\)-total labelling of planar graphs (Q512891) (← links)
• On critical trees labeled with a condition at distance two (Q556846) (← links)
• On \((p,1)\)-total labelling of 1-planar graphs (Q651281) (← links)
• Coloring the square of the Cartesian product of two cycles (Q708380) (← links)
• An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
• Acyclic colorings of products of trees (Q845661) (← links)
• The 2-dipath chromatic number of Halin graphs (Q845671) (← 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)
• \(L(j,k)\)-labelling and maximum ordering-degrees for trees (Q968198) (← links)
• (2,1)-total labelling of trees with sparse vertices of maximum degree (Q976073) (← links)
• \((2,1)\)-Total number of trees with maximum degree three (Q989489) (← 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)
• Some results on distance two labelling of outerplanar graphs (Q1036889) (← links)
• On \((d,1)\)-total numbers of graphs (Q1043541) (← links)
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers (Q1406039) (← links)
• No-hole \(L(2,1)\)-colorings (Q1408461) (← links)
• Irreducible no-hole \(L(2, 1)\)-coloring of edge-multiplicity-paths-replacement graph (Q1708400) (← 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)
• On the \(L(2,1)\)-labelings of amalgamations of graphs (Q1949093) (← links)
• \((p,q)\)-total labeling of complete graphs (Q1956251) (← links)
• Lambda number for the direct product of some family of graphs (Q2012884) (← links)
• On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs (Q2012895) (← links)
• Lambda number of the power graph of a finite group (Q2038885) (← 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)
• The \((d, 1)\)-total labelling of Sierpiński-like graphs (Q2279623) (← links)
• 2-distance colorings of some direct products of paths and cycles (Q2346336) (← links)
• \((2,1)\)-total labeling of trees with large maximum degree (Q2348054) (← links)
• A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) (Q2359803) (← links)
• The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs (Q2370433) (← links)
• \(L(p,q)\) labeling of \(d\)-dimensional grids (Q2370453) (← links)
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree (Q2370454) (← links)