Labeling trees with a condition at distance two
暂无分享,去创建一个
[1] J. Georges,et al. On the size of graphs labeled with condition at distance two , 1996 .
[2] John P. Georges,et al. On the lambda-Number of Qn and Related Graphs , 1995, SIAM J. Discret. Math..
[3] Rossella Petreschi,et al. L(h, 1)-labeling subclasses of planar graphs , 2004, J. Parallel Distributed Comput..
[4] John P. Georges,et al. Labeling Products of Complete Graphs with a Condition at Distance Two , 2001, SIAM J. Discret. Math..
[5] Rossella Petreschi,et al. L(2, 1)-Coloring Matrogenic Graphs , 2002, LATIN.
[6] P. Pardalos,et al. Handbook of Combinatorial Optimization , 1998 .
[7] John P. Georges,et al. Labeling trees with a condition at distance two , 2003, Discret. Math..
[8] W. K. Hale. Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.
[9] Tiziana Calamoneri. Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks , 2003, ICTCS.
[10] Gerard J. Chang,et al. The L(2, 1)-Labeling Problem on Graphs , 1996, SIAM J. Discret. Math..
[11] Daphne Der-Fen Liu. Sizes of Graphs with Fixed Orders and Spans for Circular-Distance-Two Labelings , 2003, Ars Comb..
[12] Jan van Leeuwen,et al. lambda-Coloring of Graphs , 2000, STACS.
[13] Rossella Petreschi,et al. lambda-Coloring matrogenic graphs , 2006, Discret. Appl. Math..
[14] Rossella Petreschi,et al. On the Radiocoloring Problem , 2002, IWDC.
[15] Carlo Mannino,et al. Models and solution techniques for frequency assignment problems , 2003, 4OR.
[16] Denise Sakai,et al. Labeling Chordal Graphs: Distance Two Condition , 1994 .
[17] Wang Dong. Radio channel assignment , 2000 .
[18] Rossella Petreschi,et al. Edge-clique graphs and the lambda-coloring problem , 2001 .
[19] J. V. D. Heuvel,et al. Graph labeling and radio channel assignment , 1998 .
[20] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[21] Jerrold R. Griggs,et al. Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..
[22] Panos M. Pardalos,et al. Frequency Assignment Problems , 1999, Handbook of Combinatorial Optimization.
[23] Alan A. Bertossi,et al. Efficient use of radio spectrum in wireless networks with channel separation between close stations , 2000, DIALM '00.