New bounds for the L(h, k) number of regular grids
暂无分享,去创建一个
[1] Jan van Leeuwen,et al. lambda-Coloring of Graphs , 2000, STACS.
[2] Daphne Der-Fen Liu,et al. On L(d, 1)-labelings of graphs , 2000, Discret. Math..
[3] Gerard J. Chang,et al. The L(2, 1)-Labeling Problem on Graphs , 1996, SIAM J. Discret. Math..
[4] Danilo Korze,et al. L(2, 1)-labeling of strong products of cycles , 2005, Inf. Process. Lett..
[5] John P. Georges,et al. On the lambda-Number of Qn and Related Graphs , 1995, SIAM J. Discret. Math..
[6] H. Whitney. The Coloring of Graphs. , 1931, Proceedings of the National Academy of Sciences of the United States of America.
[7] Alan A. Bertossi,et al. Channel Assignment with Separation for Interference Avoidance in Wireless Networks , 2003, IEEE Trans. Parallel Distributed Syst..
[8] Tiziana Calamoneri,et al. The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography , 2006, Comput. J..
[9] Tarek Makansi,et al. Transmitter-Oriented Code Assignment for Multihop Packet Radio , 1987, IEEE Trans. Commun..
[10] P. K. Jha. Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination , 2000 .
[11] Mohammad R. Salavatipour,et al. Frequency Channel Assignment on Planar Networks , 2002, ESA.
[12] Denise Sakai Troxell. Labeling Chordal Graphs: Distance Two Condition , 1994, SIAM Journal on Discrete Mathematics.
[13] W. K. Hale. Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.
[14] Tiziana Calamoneri. Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks , 2003, ICTCS.
[15] André Raspaud,et al. L(p, q) labeling of d-dimensional grids , 2007, Discret. Math..
[16] Roberto Battiti,et al. Assigning codes in wireless networks: bounds and scaling properties , 1999, Wirel. Networks.
[17] Jerrold R. Griggs,et al. Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..
[18] Alan A. Bertossi,et al. Code assignment for hidden terminal interference avoidance in multihop packet radio networks , 1995, TNET.
[19] Rossella Petreschi,et al. L(h, 1)-labeling subclasses of planar graphs , 2004, J. Parallel Distributed Comput..
[20] Pranava K. Jha,et al. On L(2, 1)-labeling of the Cartesian product of a cycle and a path , 2000, Ars Comb..