{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:30Z","timestamp":1725487650905},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540695066"},{"type":"electronic","value":"9783540695073"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-69507-3_15","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T13:35:58Z","timestamp":1184592958000},"page":"188-199","source":"Crossref","is-referenced-by-count":1,"title":["Improved Upper Bounds for \u03bb-Backbone Colorings Along Matchings and Stars"],"prefix":"10.1007","author":[{"given":"Hajo","family":"Broersma","sequence":"first","affiliation":[]},{"given":"Bert","family":"Marchal","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Paulusma","sequence":"additional","affiliation":[]},{"given":"A. N. M.","family":"Salman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1137\/S0895480100367950","volume":"16","author":"G. Agnarsson","year":"2003","unstructured":"Agnarsson, G., Halld\u00f3rsson, M.M.: Coloring Powers of Planar Graphs. SIAM J. Discrete Math.\u00a016, 651\u2013662 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1093\/comjnl\/47.2.193","volume":"47","author":"H.L. Bodlaender","year":"2004","unstructured":"Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: Approximations for \u03bb-Colorings of Graphs. The Computing Journal\u00a047, 193\u2013204 (2004)","journal-title":"The Computing Journal"},{"key":"15_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London (1976)"},{"key":"15_CR4","unstructured":"Borodin, O.V., Broersma, H.J., Glebov, A., van den Heuvel, J.: Stars and Bunches in Planar Graphs. Part\u00a0I : Triangulations (Russian). Diskretn. Anal. Issled. Oper. Ser.\u00a01 8(2), pp. 15\u201339 (2001)"},{"key":"15_CR5","unstructured":"Borodin, O.V., Broersma, H.J., Glebov, A., van den Heuvel, J.: Stars and Bunches in Planar Graphs. Part\u00a0II: General Planar Graphs and Colourings (Russian). Diskretn. Anal. Issled. Oper. Ser.\u00a01 8(4), pp. 9\u201333 (2001)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-540-30540-8_7","volume-title":"Combinatorial Geometry and Graph Theory","author":"H.J. Broersma","year":"2005","unstructured":"Broersma, H.J.: A General Framework for Coloring Problems: Old Results, New Results, and Open Problems. In: Akiyama, J., Baskoro, E.T., Kano, M. (eds.) IJCCGGT 2003. LNCS, vol.\u00a03330, pp. 65\u201379. Springer, Heidelberg (2005)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-3-540-39890-5_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H.J. Broersma","year":"2003","unstructured":"Broersma, H.J., Fomin, F.V., Golovach, P.A., Woeginger, G.J.: Backbone Colorings for Networks. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 131\u2013142. Springer, Heidelberg (2003)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"G.J. Chang","year":"1996","unstructured":"Chang, G.J., Kuo, D.: The L(2,1)-Labeling Problem on Graphs. SIAM J. Discrete Math.\u00a09, 309\u2013316 (1996)","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.tcs.2004.06.026","volume":"326","author":"J. Fiala","year":"2004","unstructured":"Fiala, J., Fishkin, A.V., Fomin, F.V.: Off-Line and On-Line Distance Constrained Labeling of Graphs. Theoret. Comput. Sci.\u00a0326, 261\u2013292 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0166-218X(00)00387-5","volume":"113","author":"J. Fiala","year":"2001","unstructured":"Fiala, J., Kloks, T., Kratochv\u00edl, J.: Fixed-Parameter Complexity of \u03bb-Labelings. Discrete Appl. Math.\u00a0113, 59\u201372 (2001)","journal-title":"Discrete Appl. Math."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.dam.2004.02.018","volume":"145","author":"J. Fiala","year":"2005","unstructured":"Fiala, J., Kratochv\u00edl, J., Proskurowski, A.: Systems of Distant Representatives. Discrete Appl. Math.\u00a0145, 306\u2013316 (2005)","journal-title":"Discrete Appl. Math."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.tcs.2005.03.013","volume":"340","author":"D.A. Fotakis","year":"2005","unstructured":"Fotakis, D.A., Nikoletseas, S.E., Papadopoulou, V.G., Spirakis, P.G.: Radiocoloring in Planar Graphs: Complexity and Approximations. Theoret. Comput. Sci.\u00a0340, 514\u2013538 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR13","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J.R. Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labelling Graphs with a Condition at Distance 2. SIAM J. Discrete Math.\u00a05, 586\u2013595 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W.K. Hale","year":"1980","unstructured":"Hale, W.K.: Frequency Assignment: Theory and Applications. Proceedings of the IEEE\u00a068, 1497\u20131514 (1980)","journal-title":"Proceedings of the IEEE"},{"key":"15_CR16","first-page":"311","volume":"19","author":"P.L. Hammer","year":"1977","unstructured":"Hammer, P.L., F\u00f6ldes, S.: Split Graphs. Congressus Numerantium\u00a019, 311\u2013315 (1977)","journal-title":"Congressus Numerantium"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<263::AID-JGT5>3.0.CO;2-V","volume":"29","author":"J. Heuvel van den","year":"1998","unstructured":"van den Heuvel, J., Leese, R.A., Shepherd, M.A.: Graph Labeling and Radio Channel Assignment. J. Graph Theory\u00a029, 263\u2013283 (1998)","journal-title":"J. Graph Theory"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1002\/jgt.10077","volume":"42","author":"J. Heuvel van den","year":"2003","unstructured":"van den Heuvel, J., McGuinness, S.: Colouring the Square of a Planar Graph. J. Graph Theory\u00a042, 110\u2013124 (2003)","journal-title":"J. Graph Theory"},{"key":"15_CR19","unstructured":"Jonas, T.K.: Graph Coloring Analogues with a Condition at Distance Two : L(2,1)-Labellings and List \u03bb-Labellings. Ph.D.\u00a0Thesis, University of South Carolina (1993)"},{"key":"15_CR20","first-page":"382","volume-title":"Progress in Industrial Mathematics at ECMI 98","author":"R.A. Leese","year":"1999","unstructured":"Leese, R.A.: Radio Spectrum: a Raw Material for the Telecommunications Industry. In: Progress in Industrial Mathematics at ECMI 98, pp. 382\u2013396. Teubner, Stuttgart (1999)"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.jctb.2004.12.005","volume":"94","author":"M. Molloy","year":"2005","unstructured":"Molloy, M., Salavatipour, M.R.: A Bound on the Chromatic Number of the Square of a Planar Graph. J. Combin. Theory\u00a094, 189\u2013213 (2005)","journal-title":"J. Combin. Theory"},{"key":"15_CR22","unstructured":"Salman, A.N.M., Broersma, H.J., Fujisawa, J., Marchal, L., Paulusma, D., Yoshimoto, K.: \u03bb-Backbone Colorings along Pairwise Disjoint Stars and Matchings. Preprint (2004), \n                    \n                      http:\/\/www.durham.ac.uk\/daniel.paulusma\/Publications\/Papers\/Submitted\/backbone.pdf"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2007: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69507-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T12:09:54Z","timestamp":1550664594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69507-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540695066","9783540695073"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69507-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}