The L(h, k)-Labelling Problem: An Updated Survey and Annotated Bibliography
暂无分享,去创建一个
[1] D. Kunz,et al. Channel assignment for cellular radio using neural networks , 1991 .
[2] Denise Sakai Troxell,et al. L(2, 1)-labelings of Cartesian products of two cycles , 2006, Discret. Appl. Math..
[3] Dietmar Kunz,et al. Channel assignment for cellular radio using simulated annealing , 1993 .
[4] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .
[5] Daniel Král,et al. A Theorem about the Channel Assignment Problem , 2003, SIAM J. Discret. Math..
[6] Daniel Král,et al. Distance constrained labelings of planar graphs with no short cycles , 2009, Discret. Appl. Math..
[7] Bruce A. Reed,et al. L(2,1)-labelling of graphs , 2008, SODA '08.
[8] Frédéric Havet,et al. k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4 , 2010, Discret. Appl. Math..
[9] Bhawani Sankar Panda,et al. L(2,1)-labeling of dually chordal graphs and strongly orderable graphs , 2012, Inf. Process. Lett..
[10] Peng-Jun Wan,et al. Near-Optimal Conflict-Free Channel Set Assignments for an Optical Cluster-Based Hypercube Network , 1997, J. Comb. Optim..
[11] Peter Damaschke. Distances in cocomparability graphs and their powers , 1992, Discret. Appl. Math..
[12] Private Communications , 2001 .
[13] Adrian Kosowski,et al. The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree , 2009, Discret. Math..
[14] S. Thomas McCormick,et al. Optimal approximation of sparse hessians and its equivalence to a graph coloring problem , 1983, Math. Program..
[15] Stephan Olariu,et al. On the L(h, k)-labeling of co-comparability graphs and circular-arc graphs , 2009, Networks.
[16] Magnús M. Halldórsson,et al. Coloring powers of planar graphs , 2000, SODA '00.
[17] Roger K. Yeh. A survey on labeling graphs with a condition at distance two , 2006, Discret. Math..
[18] Hans L. Bodlaender,et al. Dynamic Programming on Graphs with Bounded Treewidth , 1988, ICALP.
[19] Roger K. Yeh,et al. Graph distance‐dependent labeling related to code assignment in computer networks , 2005 .
[20] David Zhang,et al. Improved Bounds on the $L(2,1)$-Number of Direct and Strong Products of Graphs , 2008, IEEE Transactions on Circuits and Systems II: Express Briefs.
[21] Pranava K. Jha,et al. $L(j, \, k)$-Labelings of Kronecker Products of Complete Graphs , 2008, IEEE Transactions on Circuits and Systems II: Express Briefs.
[22] N. S. Barnett,et al. Private communication , 1969 .
[23] Subramanian Ramanathan,et al. On the complexity of distance-2 coloring , 1992, Proceedings ICCI `92: Fourth International Conference on Computing and Information.
[24] G. Wegner. Graphs with given diameter and a coloring problem , 1977 .
[25] Fred S. Roberts. No-hole 2-distant colorings , 1993 .
[26] Jan van den Heuvel,et al. Coloring the square of a planar graph , 2003 .
[27] Stephen Hurley,et al. A Parallel Genetic Algorithm for Frequency Assignment Problems , 1994 .
[28] Sajal K. Das,et al. Conflict-free star-access in parallel memory systems , 2006, J. Parallel Distributed Comput..
[29] Mohammad R. Salavatipour,et al. A bound on the chromatic number of the square of a planar graph , 2005, J. Comb. Theory, Ser. B.
[30] Jerrold R. Griggs,et al. Optimal channel assignments for lattices with conditions at distance two , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.
[31] Shen Bang-yu. L(p,q)-Labelling of Outerplanar Graphs , 2005 .
[32] G. G. Coghill,et al. Channel assignment through evolutionary optimization , 1996 .
[33] Magnús M. Halldórsson,et al. On colorings of squares of outerplanar graphs , 2004, SODA '04.
[34] Zhendong Shao,et al. The L(2, 1)-labeling on planar graphs , 2007, Appl. Math. Lett..
[35] Zhendong Shao,et al. The L(2, 1)-labeling of K1, n-free graphs and its applications , 2008, Appl. Math. Lett..
[36] Sanming Zhou,et al. Labelling Cayley Graphs on Abelian Groups , 2005, SIAM J. Discret. Math..
[37] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[38] W. K. Hale. Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.
[39] Magnús M. Hallórsson. A still better performance guarantee for approximate graph coloring , 1993 .
[40] Paul Booth,et al. Exact lambda-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips , 2012, Discret. Appl. Math..
[41] Ko-Wei Lih,et al. COLORING THE SQUARE OF AN OUTERPLANAR GRAPH , 2006 .
[42] Hirotaka Ono,et al. A Linear Time Algorithm for L(2, 1)-Labeling of Trees , 2009, ESA.
[43] Tiziana Calamoneri. Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks , 2003, ICTCS.
[44] Rudolf Mathar,et al. Channel assignment in cellular radio networks , 1993 .
[45] Oleg V. Borodin,et al. 2-distance coloring of sparse planar graphs. , 2004 .
[46] Pawel Rzazewski,et al. On Improved Exact Algorithms for L(2, 1)-Labeling of Graphs , 2010, IWOCA.
[47] Madhav V. Marathe,et al. Approximation Algorithms for Channel Assignment in Radio Networks , 1998 .
[48] Márcia R. Cerioli,et al. On L(2, 1)-coloring split, chordal bipartite, and weakly chordal graphs , 2012, Discret. Appl. Math..
[49] Magnús M. Halldórsson,et al. A Still Better Performance Guarantee for Approximate Graph Coloring , 1993, Information Processing Letters.
[50] André Raspaud,et al. L(p, q) labeling of d-dimensional grids , 2007, Discret. Math..
[51] Daniel Král,et al. Distance Constrained Labelings of K4-minor Free Graphs , 2007, Electron. Notes Discret. Math..
[52] Sanming Zhou. A channel assignment problem for optical networks modelled by Cayley graphs , 2004, Theor. Comput. Sci..
[53] László Lovász,et al. Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.
[54] Rossella Petreschi,et al. Degree sequences of matrogenic graphs , 1984, Discret. Math..
[55] Wang Weifan,et al. L ( p, q )-labelling of K 4 -minor free graphs , 2006 .
[56] Wei-Fan Wang,et al. L(p, q)-labelling of K4-minor free graphs , 2006, Inf. Process. Lett..
[57] Lianying Miao,et al. New upper bounds on the L(2, 1)-labeling of the skew and converse skew product graphs , 2011, Theor. Comput. Sci..
[58] Xuding Zhu,et al. Coloring the square of a K4-minor free graph , 2003, Discret. Math..
[59] Wei-Fan Wang. The L(2, 1)-labelling of trees , 2006, Discret. Appl. Math..
[60] Flavia Bonomo,et al. On the L(2, 1)-labelling of block graphs , 2011, Int. J. Comput. Math..
[61] Guohua Gu,et al. Bounds On The Labelling Numbers Of Chordal Graphs , 2006, FCS.
[62] N. Mahadev,et al. Threshold graphs and related topics , 1995 .
[63] Jan Kratochvíl,et al. Representing graphs by disks and balls (a survey of recognition-complexity results) , 2001, Discret. Math..
[64] Tiziana Calamoneri,et al. The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography , 2006, Comput. J..
[65] Yan Wang,et al. Labeling the r-path with a condition at distance two , 2009, Discret. Appl. Math..
[66] Stephen Hurley,et al. A tabu search algorithm for frequency assignment , 1996, Ann. Oper. Res..
[67] Daniel Král. The Channel Assignment Problem with Variable Weights , 2006, SIAM J. Discret. Math..
[68] Ko-Wei Lih,et al. Equitable Coloring of Graphs , 1998 .
[69] F. Harary,et al. Planar Permutation Graphs , 1967 .
[70] E. A. Nordhaus,et al. On Complementary Graphs , 1956 .
[71] P. K. Jha. Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment] , 2001 .
[72] Daniel Král,et al. Labeling planar graphs with a condition at distance two , 2007, Eur. J. Comb..
[73] Frank Harary,et al. A Radio Coloring of a Hypercube , 2002, Int. J. Comput. Math..
[74] Anja Kohl. Bounds for the L(d, 1): number of diameter 2 graphs, trees and cacti , 2006 .
[75] Daphne Der-Fen Liu,et al. On L(d, 1)-labelings of graphs , 2000, Discret. Math..
[76] Martin Grötschel,et al. Frequency planning and ramifications of coloring , 2002, Discuss. Math. Graph Theory.
[77] Noga Alon,et al. The Chromatic Number of Graph Powers , 2002, Combinatorics, Probability and Computing.
[78] Tarek Makansi,et al. Transmitter-Oriented Code Assignment for Multihop Packet Radio , 1987, IEEE Trans. Commun..
[79] Roberto Solis-Oba,et al. L(2, 1)L(2, 1)-labelings on the modular product of two graphs , 2013, Theor. Comput. Sci..
[80] Bruce A. Reed,et al. Griggs and Yeh's Conjecture and L(p, 1)-labelings , 2012, SIAM J. Discret. Math..
[81] J. Kuri,et al. Wireless Networking , 2008 .
[82] David Erwin,et al. On labeling the vertices of products of complete graphs with distance constraints , 2005 .
[83] Yoshiyasu Takefuji,et al. A neural network parallel algorithm for channel assignment problems in cellular radio networks , 1992 .
[84] John P. Georges,et al. Relating path coverings to vertex labellings with a condition at distance two , 1994, Discret. Math..
[85] Anil M. Shende,et al. Channel Assignment for Wireless Networks Modelled as d-Dimensional Square Grids , 2002, IWDC.
[86] Jirí Fiala,et al. Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) , 2008, ICALP.
[87] Hans L. Bodlaender,et al. A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..
[88] Paul G. Spirakis,et al. Radiocoloring in planar graphs: Complexity and approximations , 2005, Theor. Comput. Sci..
[89] Bhawani Sankar Panda,et al. L(2, 1)-labeling of perfect elimination bipartite graphs , 2011, Discret. Appl. Math..
[90] John P. Georges,et al. Labeling trees with a condition at distance two , 2003, Discret. Math..
[91] Sarah Spence Adams,et al. An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.
[92] Denise Sakai Troxell. On critical trees labeled with a condition at distance two , 2005, Discret. Math..
[93] Jan Kratochvíl,et al. Fast exact algorithm for L(2, 1)-labeling of graphs , 2011, Theor. Comput. Sci..
[94] Saverio Caminiti,et al. New bounds for the L(h, k) number of regular grids , 2006 .
[95] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.
[96] Ioan Todinca,et al. On powers of graphs of bounded NLC-width (clique-width) , 2007, Discret. Appl. Math..
[97] S. Klavzar,et al. The /spl Delta//sup 2/-conjecture for L(2,1)-labelings is true for direct and strong products of graphs , 2006, IEEE Transactions on Circuits and Systems II: Express Briefs.
[98] David G. Kirkpatrick,et al. Unit disk graph recognition is NP-hard , 1998, Comput. Geom..
[99] Arunabha Sen,et al. A new model for scheduling packet radio networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[100] Bruno Courcelle,et al. Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..
[101] Jirí Fiala,et al. Parameterized complexity of coloring problems: Treewidth versus vertex cover , 2009, Theor. Comput. Sci..
[102] Yoomi Rho,et al. L(2, 1)-labellings for direct products of a triangle and a cycle , 2013, Int. J. Comput. Math..
[103] Jerrold R. Griggs,et al. Real Number Graph Labellings with Distance Conditions , 2006, SIAM J. Discret. Math..
[104] Jing-Ho Yan,et al. On L(2, 1)-labelings of Cartesian products of paths and cycles , 2004, Discret. Math..
[105] Stanislav Jendrol,et al. Light subgraphs of graphs embedded in the plane and in the projective plane – a survey – , 2011 .
[106] Ko-Wei Lih,et al. Labeling Planar Graphs with Conditions on Girth and Distance Two , 2004, SIAM J. Discret. Math..
[107] Toru Araki,et al. Labeling bipartite permutation graphs with a condition at distance two , 2009, Discret. Appl. Math..
[108] J. L. Brenner. Labeling of Graphs , 1983 .
[109] Jirí Fiala,et al. Complexity of Partial Covers of Graphs , 2001, ISAAC.
[110] Alan A. Bertossi,et al. Code assignment for hidden terminal interference avoidance in multihop packet radio networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.
[111] Dominique de Werra,et al. Graph coloring with cardinality constraints on the neighborhoods , 2009, Discret. Optim..
[112] Patrick W. Dowd,et al. A class of scalable optical interconnection networks through discrete broadcast-select multi-domain WDM , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.
[113] Jirí Fiala,et al. Distance Constrained Labeling of Precolored Trees , 2001, ICTCS.
[114] Sanming Zhou. Distance Labelling Problems for Hypercubes and Hamming Graphs - A Survey , 2007, Electron. Notes Discret. Math..
[115] Qiaoling Ma,et al. Labelling of some planar graphs with a condition at distance two , 2007 .
[116] Gerard J. Chang,et al. The L(2, 1)-Labeling Problem on Graphs , 1996, SIAM J. Discret. Math..
[117] Tiziana Calamoneri Rossella Petreschi. λ-Coloring Matrogenic Graphs , 2005 .
[118] J. van den Heuvel. Radio Channel Assignment on 2-Dimensional Lattices , 2002 .
[119] Magnús M. Halldórsson. Approximating the L(h, k)-labelling problem , 2006 .
[120] Narsingh Deo,et al. PARALLEL ALGORITHM FOR RADIOCOLORING A , .
[121] Sylvain Gravier. CODES AND $L(2,1)$-LABELINGS IN SIERPI\'NSKI GRAPHS , 2005 .
[122] Jerrold R. Griggs,et al. Real Number Channel Assignments for Lattices , 2008, SIAM J. Discret. Math..
[123] B. A. Reed,et al. Algorithmic Aspects of Tree Width , 2003 .
[124] John P. Georges,et al. Labeling Products of Complete Graphs with a Condition at Distance Two , 2001, SIAM J. Discret. Math..
[125] Zhendong Shao,et al. Improved upper bounds on the L(2, 1) -labeling of the skew and converse skew product graphs , 2008, Theor. Comput. Sci..
[126] Pawel Rzazewski,et al. On the complexity of exact algorithm for L(2, 1)-labeling of graphs , 2011, Inf. Process. Lett..
[127] Oleg V. Borodin,et al. Sufficient conditions for planar graphs to be 2-distance ()-colourable. , 2004 .
[128] Daniel Král,et al. Distance constrained labelings of K4-minor free graphs , 2009, Discret. Math..
[129] Lianying Miao,et al. The Δ2-conjecture for L(2, 1)-labelings is true for total graphs , 2011, Appl. Math. Lett..
[130] Pranava K. Jha,et al. On L(2, 1)-labeling of the Cartesian product of a cycle and a path , 2000, Ars Comb..
[131] Jirí Fiala,et al. On distance constrained labeling of disk graphs , 2004, Theor. Comput. Sci..
[132] Sarah Spence Adams,et al. On the L(2, 1)-labelings of amalgamations of graphs , 2013, Discret. Appl. Math..
[133] Paola Vocca,et al. On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract) , 2005, SIROCCO.
[134] Gerard J. Chang,et al. Distance-two labelings of digraphs , 2007, Discret. Appl. Math..
[135] Denise Sakai Troxell. Labeling Chordal Graphs: Distance Two Condition , 1994, SIAM Journal on Discrete Mathematics.
[136] Jan Kratochvíl,et al. Exact Algorithms for L (2, 1)-Labeling of Graphs , 2007, MFCS.
[137] Aleksander Vesel,et al. Optimal L(d, 1)-labelings of certain direct products of cycles and Cartesian products of cycles , 2005, Discret. Appl. Math..
[138] Carlo Mannino,et al. Models and solution techniques for frequency assignment problems , 2003, 4OR.
[139] Jirí Fiala,et al. Distance Constrained Labelings of Graphs of Bounded Treewidth , 2005, ICALP.
[140] European Community under the “Information Society Technologies” , 2007 .
[141] David Zhang,et al. The L(2, 1)-labeling on the skew and converse skew products of graphs , 2007, Appl. Math. Lett..
[142] Paul Erdös,et al. Maximum degree in graphs of diameter 2 , 1980, Networks.
[143] Rossella Petreschi,et al. The L(2, 1)-labeling of unigraphs , 2011, Discret. Appl. Math..
[144] Wei-fan Wang,et al. Some results on distance two labelling of outerplanar graphs , 2009 .
[145] Conflict-Free Channel Assignment in Wireless Ad Hoc Networks , 2005 .
[146] Peter Che Bor Lam,et al. ON DISTANCE TWO LABELLING OF UNIT INTERVAL GRAPHS , 2009 .
[147] Gerard J. Chang,et al. L(h, k)-labelings of Hamming graphs , 2009, Discret. Math..
[148] Alan A. Bertossi,et al. Channel assignment on strongly-simplicial graphs , 2003, Proceedings International Parallel and Distributed Processing Symposium.
[149] Sanming Zhou,et al. Distance-two labellings of Hamming graphs , 2009, Discret. Appl. Math..
[150] Jan Kratochvíl,et al. Determining the L(2, 1)-Span in Polynomial Space , 2012, WG.
[151] M. Halldórsson,et al. On Powers of Chordal Graphs And Their Colorings , 2000 .
[152] John P. Georges,et al. On Regular Graphs Optimally Labeled with a Condition at Distance Two , 2004, SIAM J. Discret. Math..
[153] Martin Skoviera,et al. L(2, 1)-labelling of generalized prisms , 2012, Discret. Appl. Math..
[154] Patrick Bahls. Channel assignment on Cayley graphs , 2011, J. Graph Theory.
[155] Leizhen Cai,et al. Labelling planar graphs without 4-cycles with a condition on distance two , 2008, Discret. Appl. Math..
[156] Jerrold R. Griggs,et al. Recent progress in mathematics and engineering on optimal graph labellings with distance conditions , 2007, J. Comb. Optim..
[157] Xiao Zhou,et al. Generalized Vertex-Colorings of Partial K-Trees , 2000 .
[158] Andrzej Pelc,et al. Labeling trees with a condition at distance two , 2006, Discret. Math..
[159] Daniel Král,et al. Coloring squares of planar graphs with girth six , 2008, Eur. J. Comb..
[160] Madhumangal Pal,et al. An Efficient Algorithm to Solve L(0,1)-Labelling Problem on Interval Graphs , 2013 .
[161] Magnús M. Halldórsson,et al. Vertex coloring the square of outerplanar graphs of low degree , 2010, Discuss. Math. Graph Theory.
[162] Michael Langberg,et al. Graph Coloring , 2018, Encyclopedia of Optimization.
[163] Aleksander Vesel,et al. Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers , 2003, Discret. Appl. Math..
[164] Gerard J. Chang,et al. Distance-two labelings of graphs , 2003, Eur. J. Comb..
[165] Jan van Leeuwen,et al. Approximations for lambda-Colorings of Graphs , 2004, Comput. J..
[166] Aleksander Vesel,et al. L(2, 1)-labeling of direct product of paths and cycles , 2005, Discret. Appl. Math..
[167] G. Chang,et al. Labeling graphs with a condition at distance two , 2005 .
[168] Jirí Fiala,et al. Systems of distant representatives , 2005, Discret. Appl. Math..
[169] Rossella Petreschi,et al. L(h, 1)-labeling subclasses of planar graphs , 2004, J. Parallel Distributed Comput..
[170] André Raspaud,et al. L(p,q)-labeling of sparse graphs , 2013, J. Comb. Optim..
[171] Zhendong Shao,et al. The L(2,1)-labeling and operations of graphs , 2005, IEEE Transactions on Circuits and Systems I: Regular Papers.
[172] Uri N. Peled. Matroidal graphs , 1977, Discret. Math..
[173] John P. Georges,et al. On generalized Petersen graphs labeled with a condition at distance two , 2002, Discret. Math..
[174] Daphne Der-Fen Liu,et al. L(j, k)-labelling and maximum ordering-degrees for trees , 2010, Discret. Appl. Math..
[175] Sotiris Nikoletseas,et al. Radiocoloring Graphs via the Probabilistic Method ∗ , 2003 .
[176] Sarah Spence Adams,et al. The minimum span of L(2, 1)-labelings of certain generalized Petersen graphs , 2007, Discret. Appl. Math..
[177] Udi Rotics,et al. Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract) , 2001, SODA '01.
[178] P. K. Jha. Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination , 2000 .
[179] Danilo Korze,et al. L(2, 1)-labeling of strong products of cycles , 2005, Inf. Process. Lett..
[180] Roberto Solis-Oba,et al. L(2, 1)-Labelings on the composition of n graphs , 2010, Theor. Comput. Sci..
[181] D. Gonçalves,et al. On the L(p, 1)-labelling of graphs , 2008, Discret. Math..
[182] Jirí Fiala,et al. On the Computational Complexity of the L(2, 1)-Labeling Problem for Regular Graphs , 2005, ICTCS.
[183] David Zhang,et al. The L(2, 1)-labeling on graphs and the frequency assignment problem , 2008, Appl. Math. Lett..
[184] S. Teng. Points, spheres, and separators: a unified geometric approach to graph partitioning , 1992 .
[185] Lorna Stewart,et al. A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..
[186] John P. Georges,et al. On the lambda-Number of Qn and Related Graphs , 1995, SIAM J. Discret. Math..
[187] Fred S. Roberts,et al. T-colorings of graphs: recent results and open problems , 1991, Discret. Math..
[188] Hirotaka Ono,et al. An O(n1.75) algorithm for L(2, 1)-labeling of trees , 2009, Theor. Comput. Sci..
[189] Jerrold R. Griggs,et al. Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..
[190] Sanming Zhou,et al. The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups , 2013, J. Comb. Optim..
[191] Anja Kohl. The L(d, 1)-number of powers of paths , 2009, Discret. Math..
[192] Jan Kratochvíl,et al. Fast Exact Algorithm for L(2, 1)-Labeling of Graphs , 2011, TAMC.
[193] Jing-Ho Yan,et al. On L(d, 1)-labeling of Cartesian product of a cycle and a path , 2008, Discret. Appl. Math..
[194] Hajo Broersma,et al. Stars and bunches in planar graphs. Part II: General planar graphs and colourings , 2002 .
[195] Panos M. Pardalos,et al. Frequency Assignment Problems , 1999, Handbook of Combinatorial Optimization.
[196] Pinar Heggernes,et al. Partitioning Graphs into Generalized Dominating Sets , 1998, Nord. J. Comput..
[197] Saverio Caminiti,et al. A general approach to L(h, k)-label interconnection networks , 2005, Electron. Notes Discret. Math..
[198] Roberto Battiti,et al. Assigning codes in wireless networks: bounds and scaling properties , 1999, Wirel. Networks.
[199] Sanming Zhou,et al. Labeling outerplanar graphs with maximum degree three , 2013, Discret. Appl. Math..
[200] Subramanian Ramanathan,et al. Scheduling algorithms for multi-hop radio networks , 1992, SIGCOMM '92.
[201] J. V. D. Heuvel,et al. Graph labeling and radio channel assignment , 1998 .