{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:40Z","timestamp":1725516640017},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85097-7_33","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"351-360","source":"Crossref","is-referenced-by-count":0,"title":["A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs"],"prefix":"10.1007","author":[{"given":"Caterina","family":"De Simone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Galluccio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1109\/JSAC.2005.852240","volume":"23","author":"R. Berry","year":"2005","unstructured":"Berry, R., Modiano, E.: Optimal Transceiver Scheduling in WDM\/TDM Networks. IEEE J. on Select. Areas in Comm.\u00a023, 1479\u20131495 (2005)","journal-title":"IEEE J. on Select. Areas in Comm."},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V. Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: On certain polytopes associated with graphs. J. Combin. Theory, Ser. B\u00a018, 138\u2013154 (1975)","journal-title":"J. Combin. Theory, Ser. B"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1017\/S030500410006610X","volume":"100","author":"A.G. Chetwynd","year":"1986","unstructured":"Chetwynd, A.G., Hilton, A.J.W.: Star multigraphs with three vertices of maximum degree. Math. Proc. Cambridge Phil. Soc.\u00a0100, 303\u2013317 (1986)","journal-title":"Math. Proc. Cambridge Phil. Soc."},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0167-5060(08)70453-9","volume":"41","author":"A.G. Chetwynd","year":"1989","unstructured":"Chetwynd, A.G., Hilton, A.J.W.: The edge-chromatic class of graphs with maximum degree at least |V|\u2009\u2212\u20093. Annals of Discrete Mathematics\u00a041, 91\u2013110 (1989)","journal-title":"Annals of Discrete Mathematics"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Burlingham, L.S.: Complement reducible graphs. Discrete Appl. Math.\u00a03, 163\u2013174 (1981)","journal-title":"Discrete Appl. Math."},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. of Comput.\u00a014, 926\u2013934 (1985)","journal-title":"SIAM J. of Comput."},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0012-365X(71)90022-7","volume":"1","author":"D. Werra De","year":"1972","unstructured":"De Werra, D.: Investigations on an edge-coloring problem. Discrete Math.\u00a01, 167\u2013179 (1972)","journal-title":"Discrete Math."},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2007.07.046","volume":"389","author":"C. Simone De","year":"2007","unstructured":"De Simone, C., Galluccio, A.: Edge-colouring of regular graphs of large degree. Theor. Comp. Sc.\u00a0389, 91\u201399 (2007)","journal-title":"Theor. Comp. Sc."},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/j.tcs.2005.12.010","volume":"355","author":"C. Simone De","year":"2006","unstructured":"De Simone, C., de Mello, C.P.: Edge colouring of join graphs. Theor. Comp. Sc.\u00a0355, 364\u2013370 (2006)","journal-title":"Theor. Comp. Sc."},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"14","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-colouring. SIAM J. Comput.\u00a014, 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/jgt.3190160207","volume":"16","author":"D.G. Hoffman","year":"1992","unstructured":"Hoffman, D.G., Rodger, C.A.: The chromatic index of complete multipartite graphs. J. Graph Theory\u00a016, 159\u2013163 (1992)","journal-title":"J. Graph Theory"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF02022041","volume":"4","author":"R.H. M\u00f6hring","year":"1985","unstructured":"M\u00f6hring, R.H.: Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions. Ann. Oper. Res.\u00a04, 195\u2013225 (1985)","journal-title":"Ann. Oper. Res."},{"key":"33_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1093\/imamat\/9.1.23","volume":"9","author":"C.J.H. McDiarmid","year":"1972","unstructured":"McDiarmid, C.J.H.: The solution of a timetabling problem. J. Inst. Math. Appl.\u00a09, 23\u201334 (1972)","journal-title":"J. Inst. Math. Appl."},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/S0012-365X(96)00202-6","volume":"165\/166","author":"L. Perkovic","year":"1997","unstructured":"Perkovic, L., Reed, B.: Edge coloring regular graphs of high degree. Discrete Math.\u00a0165\/166, 567\u2013570 (1997)","journal-title":"Discrete Math."},{"key":"33_CR15","unstructured":"Perkovic, L.: Edge Coloring, Polyhedra and Probability, Ph.D Thesis Carnegie Mellon Univ., US (1998)"},{"key":"33_CR16","first-page":"25","volume":"3","author":"V.G. Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret Analiz\u00a03, 25\u201330 (1964) (in Russian)","journal-title":"Diskret Analiz"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T01:10:27Z","timestamp":1551575427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540850960","9783540850977"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}