Pages that link to "Item:Q4881295"

The following pages link to The $L(2,1)$-Labeling Problem on Graphs (Q4881295):

Displaying 50 items.

• \(L(3,2,1)\)-labeling of triangular and toroidal grids (Q301947) (← links)
• Backbone coloring for graphs with large girths (Q385734) (← links)
• \(L(2,1)\)-labelings on the modular product of two graphs (Q387006) (← links)
• Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
• \(L(p,2,1)\)-labeling of the infinite regular trees (Q393463) (← links)
• The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
• Distance three labelings of trees (Q415278) (← links)
• On backbone coloring of graphs (Q434190) (← links)
• \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (Q436601) (← links)
• The game \(L(d,1)\)-labeling problem of graphs (Q456896) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• \(L(2,1)\)-labelings of subdivisions of graphs (Q472974) (← links)
• On characterizing radio \(k\)-coloring problem by path covering problem (Q488288) (← links)
• \(L(2,1)\)-labeling of interval graphs (Q500005) (← links)
• A note on \(L (2, 1)\)-labelling of trees (Q511194) (← links)
• \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs (Q512552) (← links)
• A lower bound technique for radio \(k\)-coloring (Q512555) (← links)
• New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q533885) (← links)
• Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
• The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs (Q548395) (← links)
• On critical trees labeled with a condition at distance two (Q556846) (← links)
• \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) (Q602756) (← links)
• Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
• \(L(2,1)\)-labeling of perfect elimination bipartite graphs (Q643028) (← links)
• Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks (Q691628) (← links)
• On distance constrained labeling of disk graphs (Q703553) (← links)
• On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs (Q714037) (← links)
• Linear and cyclic distance-three labellings of trees (Q741540) (← links)
• Equitable colorings of bounded treewidth graphs (Q817768) (← links)
• List version of \(L(d,s)\)-labelings (Q817777) (← links)
• An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees (Q837161) (← links)
• \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs (Q844189) (← links)
• The 2-dipath chromatic number of Halin graphs (Q845671) (← links)
• \(\lambda\)-coloring matrogenic graphs (Q860405) (← links)
• The \(L(2,1)\)-labeling on planar graphs (Q868019) (← links)
• Distance-two labelings of digraphs (Q881579) (← links)
• A complete \(L (2, 1)\) span characterization for small trees (Q896092) (← links)
• Injective colorings with arithmetic constraints (Q897262) (← 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)
• Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
• Graph labellings with variable weights, a survey (Q967309) (← links)
• Complexity of (p,1)-total labelling (Q967327) (← links)
• Optimal radio labellings of complete \(m\)-ary trees (Q968168) (← 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)
• The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
• \(L(2,1)\)-labelings on the composition of \(n\) graphs (Q986562) (← links)