{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:44Z","timestamp":1725558884880},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642143892"},{"type":"electronic","value":"9783642143908"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14390-8_2","type":"book-chapter","created":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T09:11:54Z","timestamp":1278493914000},"page":"11-20","source":"Crossref","is-referenced-by-count":0,"title":["Interval Wavelength Assignment in All-Optical Star Networks"],"prefix":"10.1007","author":[{"given":"Robert","family":"Janczewski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Ma\u0142afiejska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Ma\u0142afiejski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0012-365X(89)90073-3","volume":"75","author":"I. Algor","year":"1989","unstructured":"Algor, I., Alon, N.: The star arboricity of graph. Discrete Mathematics\u00a075, 11\u201322 (1989)","journal-title":"Discrete Mathematics"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF01305230","volume":"12","author":"N. Alon","year":"1992","unstructured":"Alon, N., McDiarmid, C., Reed, B.: Star arboricity. Combinatorica\u00a012, 375\u2013380 (1992)","journal-title":"Combinatorica"},{"key":"2_CR3","unstructured":"Amini, O., Havet, F., Huc, F., Thomasse, S.: WDM and directed star arboricity. In: INRIA, France, pp. 1\u201320 (2007)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1006\/jctb.1994.1053","volume":"62","author":"A. Asratian","year":"1994","unstructured":"Asratian, A., Kamalian, R.: Investigation on interval edge-colorings of graphs. J. Combin. Theory. Ser. B\u00a062, 34\u201343 (1994)","journal-title":"J. Combin. Theory. Ser. B"},{"key":"2_CR5","volume-title":"Proc. of WOCS 1997","author":"B. Beaquier","year":"1997","unstructured":"Beaquier, B., Bermond, J.C., Gargano, L., Hell, P., Perennes, S., Vacarro, U.: Graph problems arising from wavelength-routing in all-optical networks. In: Proc. of WOCS 1997. IEEE, Los Alamitos (1997)"},{"key":"2_CR6","unstructured":"Brandt, R., Gonzalez, T.F.: Multicasting using WDM in Multifiber Optical Star Networks. In: Proc. of the 15th IASTED International Conference on Parallel and Distributed Computing and Systems PDCS 2003, Canada, pp. 56\u201361 (2003)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1142\/S0219265905001484","volume":"6","author":"R. Brandt","year":"2005","unstructured":"Brandt, R., Gonzalez, T.F.: Wavelength assignment in multifiber optical star networks under the multicasting communication mode. Journal of Interconnection Networks\u00a06, 383\u2013405 (2005)","journal-title":"Journal of Interconnection Networks"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0012-365X(93)90286-3","volume":"122","author":"R.A. Brualdi","year":"1993","unstructured":"Brualdi, R.A., Massey, J.Q.: Incidence and strong edge colorings of graphs. Discrete Mathematics\u00a0122, 51\u201358 (1993)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"2_CR9","first-page":"47","volume":"15","author":"D.L. Chen","year":"1998","unstructured":"Chen, D.L., Liu, X.K., Wang, S.D.: The incidence chromatic number and the incidence coloring conjecture of graphs. Math. Econom.\u00a015(3), 47\u201351 (1998)","journal-title":"Math. Econom."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0012-365X(01)00302-8","volume":"256","author":"D.L. Chen","year":"2002","unstructured":"Chen, D.L., Pang, S.C., Wang, S.D.: The incidence coloring number of Halin graphs and outerplanar graphs. Discrete Mathematics\u00a0256, 397\u2013405 (2002)","journal-title":"Discrete Mathematics"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.disc.2004.01.015","volume":"283","author":"M.H. Dolama","year":"2004","unstructured":"Dolama, M.H., Sopena, E., Zhu, X.: Incidence coloring of k-degenerated graphs. Discrete Mathematics\u00a0283, 121\u2013128 (2004)","journal-title":"Discrete Mathematics"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Giaro, K.: Interval edge-coloring Contemporary Mathematics. In: Kubale, M. (ed.) Graph Colorings, pp. 105\u2013121. AMS (2004)","DOI":"10.1090\/conm\/352\/08"},{"key":"2_CR13","first-page":"37","volume":"37","author":"K. Giaro","year":"1999","unstructured":"Giaro, K., Kubale, M., Ma\u0142afiejski, M.: Compact scheduling in open shop with zero-one time operations. INFOR\u00a037, 37\u201347 (1999)","journal-title":"INFOR"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0012-365X(00)00437-4","volume":"236","author":"K. Giaro","year":"2001","unstructured":"Giaro, K., Kubale, M., Ma\u0142afiejski, M.: Consecutive colorings of the edges of general graphs. Discrete Mathemathics\u00a0236, 131\u2013143 (2001)","journal-title":"Discrete Mathemathics"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0012-365X(95)00342-T","volume":"163","author":"B. Guiduli","year":"1997","unstructured":"Guiduli, B.: On incidence coloring and star arboricity of graphs. Discrete Mathematics\u00a0163, 275\u2013278 (1997)","journal-title":"Discrete Mathematics"},{"key":"2_CR16","first-page":"465","volume":"13","author":"R. Janczewski","year":"2007","unstructured":"Janczewski, R., Ma\u0142afiejski, M.: Incidence coloring of multitrees. Zesz. Nauk. Pol. Gd.\u00a013, 465\u2013472 (2007) (in Polish)","journal-title":"Zesz. Nauk. Pol. Gd."},{"key":"2_CR17","first-page":"481","volume":"13","author":"R. Janczewski","year":"2007","unstructured":"Janczewski, R., Ma\u0142afiejska, A., Ma\u0142afiejski, M.: Interval incidence coloring of graphs. Zesz. Nauk. Pol. Gd.\u00a013, 481\u2013488 (2007) (in Polish)","journal-title":"Zesz. Nauk. Pol. Gd."},{"key":"2_CR18","first-page":"1","volume":"12","author":"R. Janczewski","year":"2008","unstructured":"Janczewski, R., Ma\u0142afiejska, A., Ma\u0142afiejski, M.: Interval incidence coloring of graphs. Rap. Tech. WETI\u00a012, 1\u201316 (2008) (in Polish)","journal-title":"Rap. Tech. WETI"},{"key":"2_CR19","first-page":"1","volume":"16","author":"R. Janczewski","year":"2008","unstructured":"Janczewski, R., Ma\u0142afiejska, A., Ma\u0142afiejski, M.: The complexity of interval incidence coloring of graphs. Rap. Tech. WETI\u00a016, 1\u201317 (2008) (in Polish)","journal-title":"Rap. Tech. WETI"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.1016\/j.disc.2007.03.076","volume":"308","author":"X. Li","year":"2008","unstructured":"Li, X., Tu, J.: NP-completeness of 4-incidence colorability of semi-cubic graphs. Discrete Mathematics\u00a0308, 1334\u20131340 (2008)","journal-title":"Discrete Mathematics"},{"key":"2_CR21","unstructured":"Ma\u0142afiejska, A.: Interval coloring of graphs MSc Thesis, University of Gda\u0144sk, pp. 1\u201370 (2008)"},{"issue":"7","key":"2_CR22","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/35.933446","volume":"39","author":"E. Modiano","year":"2001","unstructured":"Modiano, E., Lin, P.J.: Traffic grooming in WDM networks. IEEE Communications Magazine\u00a039(7), 124\u2013129 (2001)","journal-title":"IEEE Communications Magazine"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0012-365X(01)00457-5","volume":"252","author":"W.C. Shiu","year":"2002","unstructured":"Shiu, W.C., Lam, P.C.B., Chen, D.-L.: Note on incidence coloring for some cubic graphs. Discrete Mathematics\u00a0252, 259\u2013266 (2002)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14390-8_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:25:58Z","timestamp":1619785558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14390-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642143892","9783642143908"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14390-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}