64
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

On (s,t)-relaxed L(1,1)-labelling of trees

&
Pages 1219-1227 | Received 14 Oct 2015, Accepted 04 Mar 2016, Published online: 27 May 2016

References

  • J. Araujo, J.-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski, Weighted improper colouring, J. Discrete Algorithms 16 (2012), pp. 53–66. doi: 10.1016/j.jda.2012.07.001
  • T. Calamoneri, The L(h,k)-labeling problem: An updated survey and annotated bibliography, Comput. J. 54(8) (2011), pp. 1344–1371. doi: 10.1093/comjnl/bxr037
  • G.J. Chang and D. Kuo, The L(2,1)-labeling problem on graphs, SIAM J. Discrete Math. 9 (1996), pp. 309–316. doi: 10.1137/S0895480193245339
  • L.J. Cowen, R.H. Cowen, and D.R. Woodall, Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency, J. Graph Theory 10(2) (1986), pp. 187–195. doi: 10.1002/jgt.3190100207
  • B. Dai and W. Lin, On (s,t)-relaxed L(2,1)-labelings of the square lattice, Inf. Process. Lett. 113(19–21) (2013), pp. 704–709. doi: 10.1016/j.ipl.2013.06.012
  • B. Dai and W. Lin, On (s,t)-relaxed L(2,1)-labelings of the hexagonal lattice, Ars Combin. (2013).
  • W. Deuber and X. Zhu, Relaxed coloring of a graph, Graphs Combin. 14 (1998), pp. 121–130. doi: 10.1007/s003730050020
  • J.R. Griggs and X.T. Jin, Recent progress in mathematics and engineering on optimal graph labellings with distance conditions, J. Comb. Optim. 14(2–3) (2007), pp. 249–257. doi: 10.1007/s10878-007-9055-7
  • J.R. Griggs and R.K. Yeh, Labeling graphs with a condition at distance 2, SIAM J. Discrete Math. 5 (1992), pp. 586–595. doi: 10.1137/0405048
  • W. Lin, On (s,t)-relaxed L(2,1)-labeling of graphs, to appear in J. Comb. Optim. 31(1) (2016), pp. 405–426. doi: 10.1007/s10878-014-9746-9
  • W. Lin and B. Dai, On (s,t)-relaxed L(2,1)-labelings of the triangular lattice, J. Comb. Optim. 29(3) (2015), pp. 655–669. doi: 10.1007/s10878-013-9615-y
  • S.T. McCormick, Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem, Math. Program. 26(2) (1983), pp. 153–171. doi: 10.1007/BF02592052
  • R.K. Yeh, A survey on labeling graphs with a condition at distance two, Discrete Math. 306 (2006), pp. 1217–1231. doi: 10.1016/j.disc.2005.11.029

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.