References
- G. Agnarsson, M.M. Halldórsson, Coloring powers of planar graphs, in: Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM, 2000, pp. 654–662.
- G.AgnarssonR.GreenlawM.M.HalldorssonOn powers of chordal graphs and their coloringsCongr. Numer.10020004165
- A. Jiang, M. Cook, J. Bruck, Optimal -interleaving on tori, in: Proc. IEEE Int’l Symposium on Information Theory, ISIT’04, 2004, pp. 22–31.
- G.H.ConwayN.J.A.SloaneSpherePacking: Lattices and Groups1988Springer-Verlag
- N. Linial, D. Peleg, Y. Rabinovich, M. Saks, Sphere packing and local majorities in graphs, in: Proc. 2nd ISTCS, 1993, pp. 141–149.
- T.CalamoneriThe -labelling problem: An updated survey and annotated bibliographyComput. J.548201113441371
- F.S.RobertsT-Colorings of graphs: recent results and open problemsDiscrete Math.931991229245
- J.GriggsR.K.YehLabeling graphs with a condition at distance twoSIAM J. Discrete Math.51992586595
- A.A.BertossiM.A.BonuccelliCode assignment for hidden terminal interference avoidance in multihop packet radio networksIEEE/ACM Trans. Netw.31995441449
- S.PaulM.PalA.PalAn efficient algorithm to solve -labelling problem on interval graphsAdvanced Modeling and Optimization15120133143
- S.PaulM.PalA.Pal-labeling of interval graphsJ. Appl. Math. Comput.491–22015419432
- A.RaychaudhuriOn powers of interval and unit interval graphsCongr. Numer.591987235242
- M.C.GolumbicAlgorithmic Graph Theory and Perfect Graphssecond ed.2004Elsevier
- S.OlariuAn optimal greedy heuristic to color interval graphsInform. Process. Lett.3719912125
- M.PalG.P.BhattacharjeeA sequential algorithm for finding a maximum weight k-independent set on interval graphsInt. J. Comput. Math.601996205214
- M.PalS.MondalD.BeraT.K.PalAn optimal parallel algorithm for computing cut vertices and blocks on interval graphsIntern. J. Computer Mathematics75120005970
- A.RanaA.PalM.PalThe conditional covering problem on unweighted interval graphs with nonuniform coverage radiusMath. Comput. Sci.620123341
- A.SahaM.PalT.K.PalAn optimal parallel algorithm to find 3-tree spanner of interval graphInt. J. Comput. Math.8232005259274
- A.SahaM.PalT.K.PalAn optimal parallel algorithm to find all-pairs shortest paths on circular-arc graphsJ. Appl. Math. Comput.171–22005123
- A.SahaM.PalT.K.PalSelection of programme slots of television channels for giving advertisement: A graph theoretic approachInform. Sci.17712200724802492
- M.PalG.P.BhattacharjeeAn optimal parallel algorithm to color an interval graphParallel Process. Lett.61996439449
- M.PalG.P.BhattacharjeeAn optimal parallel algorithm for computing all maximal cliques of an interval graph and its applicationsJ. Inst. Eng. (India)7619952933