{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:06Z","timestamp":1759063446575},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_33","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"395-406","source":"Crossref","is-referenced-by-count":50,"title":["\u03bb-Coloring of Graphs"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ton","family":"Kloks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard B.","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"van Leeuwen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B. S. Baker","year":"1994","unstructured":"B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. ACM 41 (1994) pp. 153\u2013180.","journal-title":"J. ACM"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1019146910724","volume":"5","author":"R. Battiti","year":"1999","unstructured":"Battiti, R., A.A. Bertossi and M.A. Bonuccelli, Assigning codes in wireless networks: Bounds and scaling properties, Wireless Networks 5 (1999) pp. 195\u2013209.","journal-title":"Wireless Networks"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1109\/90.413218","volume":"3","author":"A.A. Bertossi","year":"1995","unstructured":"Bertossi A.A. and M.A. Bonuccelli, Code assignment for hidden terminal interference avoidance in multihop packet radio networks, IEEE\/ACM Trans. on Net-working 3 (1995) pp. 441\u2013449.","journal-title":"IEEE\/ACM Trans. on Net-working"},{"key":"33_CR4","unstructured":"Bertossi A.A., C. Pinotti and R.B. Tan, L(2, 1, 1)-Labeling problem on graphs, In preparation (1999)."},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H. Bodlaender","year":"1996","unstructured":"Bodlaender, H., A linear time algorithm for finding tree-decompositions of small treewidth, SIAM Journal on Computing 25 (1996) pp. 1305\u20131317.","journal-title":"SIAM Journal on Computing"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Bodlaender, H., T. Kloks, R.B. Tan and J. van Leeuwen, \u03bb-coloring of graphs, Tech. Report, Dept. of Computer Science, Utrecht University (1999), in preparation.","DOI":"10.1007\/3-540-46541-3_33"},{"key":"33_CR7","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: a Survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., V.B. Le and J.P. Spinrad, Graph Classes: a Survey, SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia (1999)."},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"G. J. Chang","year":"1996","unstructured":"Chang, G. J. and D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Disc. Math. 9 (1996) pp. 309\u2013316.","journal-title":"SIAM J. Disc. Math."},{"issue":"12","key":"33_CR9","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","volume":"33","author":"I. Chlamtac","year":"1985","unstructured":"Chlamtac, I. and S. Kutten, On broadcasting in radio networks-problem analysis and protocol design, IEEE Trans. on Comm. 33 No. 12 (1985) pp. 1240\u20131246.","journal-title":"IEEE Trans. on Comm."},{"issue":"6","key":"33_CR10","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1109\/TC.1987.1676965","volume":"36","author":"I. Chlamtac","year":"1987","unstructured":"Chlamtac, I. and S. Pinter, Distributed nodes organization algorithm for channel access in a multihop dynamic radio network, IEEE Trans. on Computers 36 No. 6 (1987) pp. 728\u2013737.","journal-title":"IEEE Trans. on Computers"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G.A. Dirac","year":"1961","unstructured":"Dirac, G.A., On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25 (1961) pp. 71\u201376.","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"33_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-46784-X_33","volume-title":"Graph-Theoretic Concept of Computer Science, Proceedings 25th WG\u2019 99","author":"J. Fiala","year":"1999","unstructured":"Fiala J., T. Kloks and J. Kratochv\u00edl, Fixed-parameter complexity of \u03bb-labelings, In: Graph-Theoretic Concept of Computer Science, Proceedings 25th WG\u2019 99, Lecture Notes in Computer Science vol. 1665, Springer Verlag (1999), pp. 350\u2013363."},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1002\/(SICI)1097-0118(199605)22:1<47::AID-JGT7>3.0.CO;2-L","volume":"22","author":"J. P. Georges","year":"1996","unstructured":"Georges, J. P. and D. W. Mauro, On the size of graphs labeled with a condition at distance two, Journal of Graph Theory 22 (1996) pp. 47\u201357.","journal-title":"Journal of Graph Theory"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0012-365X(93)E0098-O","volume":"135","author":"J. P. Georges","year":"1994","unstructured":"Georges, J. P., D. W. Mauro and M. A. Whittlesey, Relating path coverings to vertex labelings with a condition at distance two, Discrete Mathematics 135 (1994) pp. 103\u2013111.","journal-title":"Discrete Mathematics"},{"key":"33_CR15","volume-title":"Algorithmic graph theory and perfect graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York (1980)."},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J. R. Griggs","year":"1992","unstructured":"Griggs, J. R. and R. K. Yeh, Labeling graphs with a condition at distance 2, SIAM J. Disc. Math. 5 (1992) pp. 586\u2013595.","journal-title":"SIAM J. Disc. Math."},{"key":"33_CR17","unstructured":"Harary, F., Private communication to Paul Spirakis."},{"key":"33_CR18","unstructured":"Jonas, K., Graph colorings analogues with a condition at distance two: L(2, 1)-labelings and list \u03bb-labelings, Ph.D. thesis, University of South Carolina (1993)."},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1996.0034","volume":"21","author":"G. Kant","year":"1996","unstructured":"Kant, G., Augmenting Outerplanar Graphs, J. Algorithms 21 (1996) pp. 1\u201325.","journal-title":"J. Algorithms"},{"key":"33_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth-computations and approximations","author":"T. Kloks","year":"1994","unstructured":"Kloks, T., Treewidth-computations and approximations, Springer-Verlag, LNCS 842 (1994)."},{"key":"33_CR21","first-page":"13","volume":"47","author":"D. D.-F. Liu","year":"1997","unstructured":"Liu, D. D.-F. and R. K. Yeh, On distance two labelings of graphs, ARS Combinatorica 47 (1997) pp. 13\u201322.","journal-title":"ARS Combinatorica"},{"issue":"12","key":"33_CR22","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1109\/TCOM.1987.1096728","volume":"35","author":"T. Makansi","year":"1987","unstructured":"Makansi, T., Transmitter-oriented code assignment for multihop packet radio, IEEE Trans. on Comm. 35 No. 12 (1987) pp. 1379\u20131382.","journal-title":"IEEE Trans. on Comm."},{"key":"33_CR23","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1137\/S0895480191223178","volume":"7","author":"D. Sakai","year":"1994","unstructured":"Sakai, D., Labeling chordal graphs: distance two condition, SIAM J. Disc. Math. 7 (1994) pp. 133\u2013140.","journal-title":"SIAM J. Disc. Math."},{"key":"33_CR24","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/S0895480192242821","volume":"8","author":"M. A. Whittlesey","year":"1995","unstructured":"Whittlesey, M. A., J. P. Georgess and D. W. Mauro, On the lambda-coloring of Q n and related graphs, SIAM J. Disc. Math. 8 (1995) pp. 499\u2013506.","journal-title":"SIAM J. Disc. Math."},{"key":"33_CR25","unstructured":"Yeh, R.K., Labeling graphs with a condition at distance two, Ph.D. Thesis, University of South Carolina (1990)."},{"key":"33_CR26","unstructured":"Zhou, X., Y. Kanari and T. Nishizeki, Generalized Vertex-Colorings of Partial k-Trees, IEICE Trans. Fundamentals (2000), to appear."}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:10:10Z","timestamp":1556734210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}