L(3, 2, 1)- and L(4, 3, 2, 1)-labeling problems on interval graphs
暂无分享,去创建一个
[1] Alan A. Bertossi,et al. Approximate L(δ 1 ,δ 2 ,…,δ t )-coloring of trees and interval graphs , 2007 .
[2] Madhumangal Pal,et al. Intersection Graphs: An Introduction , 2014, ArXiv.
[3] Jerrold R. Griggs,et al. Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..
[4] Jean Clipperton,et al. L(d,2,1)-Labeling of Simple Graphs , 2008 .
[5] Tiziana Calamoneri,et al. The L(h, k)-Labelling Problem: An Updated Survey and Annotated Bibliography , 2011, Comput. J..
[6] Denise Sakai,et al. Labeling Chordal Graphs: Distance Two Condition , 1994 .
[7] Madhumangal Pal,et al. L(0, 1)-Labelling of Cactus Graphs , 2012 .
[8] Madhumangal Pal,et al. A Data Structure on Interval Graphs and Its Applications , 1997, J. Circuits Syst. Comput..
[9] Roger K. Yeh,et al. $L(3,2,1)$-LABELING OF GRAPHS , 2011 .
[10] Madhumangal Pal,et al. L(2,1)-labeling of interval graphs , 2015, International Journal of Mathematics for Industry.
[11] Gerard J. Chang,et al. Distance-two labelings of graphs , 2003, Eur. J. Comb..
[12] Liu Jia-zhuang. The L(3,2,1)-Labeling Problem on Graphs , 2004 .
[13] Madhumangal Pal,et al. An Efficient Algorithm to Solve L(0,1)-Labelling Problem on Interval Graphs , 2013 .
[14] Jan van Leeuwen,et al. Approximations for lambda-Colorings of Graphs , 2004, Comput. J..
[15] Madhumangal Pal,et al. An Optimal Parallel Algorithm to Color an Interval Graph , 1996, Parallel Process. Lett..
[16] Richard B. Tan,et al. L(h, 1, 1)-labeling of outerplanar graphs , 2006, Math. Methods Oper. Res..
[17] W. K. Hale. Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.
[18] Madhumangal Pal,et al. L (3, 2, 1)-Labeling Problems on Permutation Graphs , 2017 .
[19] Madhumangal Pal,et al. A linear time algorithm to compute square of interval graphs and their colouring , 2016, AKCE Int. J. Graphs Comb..
[20] Jing-Ho Yan,et al. On L(d, 1)-labeling of Cartesian product of a cycle and a path , 2008, Discret. Appl. Math..
[21] Madhumangal Pal,et al. Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph , 1995, Int. J. Comput. Math..
[22] Tiziana Calamoneri. Optimal L(δ1, δ2, 1)-labeling of eight-regular grids , 2013, Inf. Process. Lett..