L(3,2,1)- and 
L(4,3,2,1)-labeling problems on interval graphs
References
- W.K.HaelFrequency assignment: theory and applicationsProc. IEEE68198014971514
- J.GriggsR.K.YehLabeling graphs with a condition at distance twoSIAM J. Discrete Math.51992586595
- G.J.ChangC.LuDistance two labelling of graphsEuropean J. Combin.2420035358
- S.H.ChiangJ.H.YanOn L(d,1)-labeling of cartesian product of a pathDiscrete Appl. Math.15615200828672881
- S.PaulM.PalA.PalL(2,1)-labeling of circular-arc graphAnn. Pure Appl. Math.522014208219
- D.SakaiLabeling chordal graphs with a condition at distance twoSIAM J. Discrete Math.71994133140
- A.A.BertossiC.M.PinottiApproximate L(δ1,δ2,…,δt)-coloring of trees and interval graphsNetworks4932007204216
- H.L.BodlaenderT.KloksR.B.TanJ.V.LeeuwenApproximations for λ-colorings of graphsComput. J.4722004193204
- N.KhanM.PalA.PalL(2,1)-total labeling of cactus graphsInternat. J. Inform. Comput. Sci.542010243260
- N.KhanM.PalA.PalL(0,1)-labeling of cactus graphsCommun. Network420121829
- T.CalamoneriL(δ1,δ2,1)-labeling of eight gridsInform. Process. Lett.1132013361364
- Sk.AmanathullaM.PalL(0,1)- and L(1,1)-labeling problems on circular-arc graphsInt. J. Soft Comput.1162016343350
- T.CalamoneriThe L(h,k)-labeling problem: an updated survey and annotated bibliographyComput. J.548201113441371
- J.ClippertonJ.GehrtzZ.SzaniszloD.TorkornooL(3,2,1)-labeling of Simple Graphs2006VERUM, Valparaiso University
- M.L.ChiaD.QuaH.LiaoC.YangR.K.YeaL(3,2,1)-labeling of graphsTaiwanese J. Math.156201124392457
- J.LiuZ.ShaoThe L(3,2,1)-labeling problem on graphsMath. Appl.1742004596602
- J.ClippertonL(d,2,1)-labeling of simple graphsMath J.92008111
- B.M.KimW.HwangB.C.SongL(3,2,1)-labeling for product of a complete graph and cycleTaiwanese J. Math.201410.11650/tjm.18.2014.4632
- J.ClippertonL(4,3,2,1)-labeling of simple graphsAppl. Math. Sci.12201195102
- S.PaulM.PalA.PalL(2,1)-labeling of interval graphJ. Appl. Math. Comput., ISSN4912015419432
- S.PaulM.PalA.PalAn efficient algorithm to solve L(0,1)-labeling problem on interval graphsAdv. Model. Optim.1512013113
- S.PaulM.PalA.PalA linear time algorithm to compute square of interval graphs and their colouringAKCE Int. J. Graphs Comb.13120165464
- T.CalamoneriG.EmanueleFuscoRichard B.TanPaola Vocca, L(h,1,1)-labeling of outerplanar graphsMath. Meth Oper. Res.692009307321
- Sk.AmanathullaM.PalL(3,2,1)- and L(4,3,2,1)-labeling problems on circular-arc graphsInt. J. Control Theory Appl.9342016869884
- Sk.AmanathullaM.PalL(3,2,1)-labeling problems on permutation graphsTransylv. Rev.2514201739393953
- M.PalG.P.BhattacharjeeOptimal sequential and parallel algorithms for computing the diameter and the center of an interval graphInt. J. Comput. Math.591995113
- M.PalG.P.BhattacharjeeAn optimal parallel algorithm to color an interval graphParallel Process. Lett.61996439449
- M.PalIntersection graphs: An introductionAnn. Pure Appl. Math.420134193
- M.PalG.P.BhattacharjeeA data structure on interval graphs and its applicationsJ. Circuits Syst. Comput.71997165175