{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:12Z","timestamp":1759063572625},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,5,23]],"date-time":"2009-05-23T00:00:00Z","timestamp":1243036800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s10878-009-9235-8","type":"journal-article","created":{"date-parts":[[2009,5,22]],"date-time":"2009-05-22T17:51:04Z","timestamp":1243014664000},"page":"417-428","source":"Crossref","is-referenced-by-count":5,"title":["Edge-colouring of joins of regular graphs, I"],"prefix":"10.1007","volume":"18","author":[{"given":"Caterina","family":"De Simone","sequence":"first","affiliation":[]},{"given":"Anna","family":"Galluccio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,23]]},"reference":[{"key":"9235_CR1","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1109\/JSAC.2005.852240","volume":"23","author":"R Berry","year":"2005","unstructured":"Berry R, Modiano E (2005) Optimal transceiver scheduling in WDM\/TDM networks. IEEE J Sel Areas Comm 23:1479\u20131495","journal-title":"IEEE J Sel Areas Comm"},{"key":"9235_CR2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"LS Burlingham","year":"1981","unstructured":"Burlingham LS, Corneil DG, Lerchs H (1981) Complement reducible graphs. Discrete Appl Math 3:163\u2013174","journal-title":"Discrete Appl Math"},{"key":"9235_CR3","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal V (1975) On certain polytopes associated with graphs. J Comb Theory, Ser B 18:138\u2013154","journal-title":"J Comb Theory, Ser B"},{"key":"9235_CR4","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/jgt.3190080403","volume":"8","author":"AG Chetwynd","year":"1984","unstructured":"Chetwynd AG, Hilton AJW (1984) The chromatic index of graphs of even order with many edges. J Graph Theory 8:463\u2013470","journal-title":"J Graph Theory"},{"key":"9235_CR5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0167-5060(08)70453-9","volume":"41","author":"AG Chetwynd","year":"1989","unstructured":"Chetwynd AG, Hilton AJW (1989) The edge-chromatic class of graphs with maximum degree at least |V|\u22123. Ann Discrete Math 41:91\u2013110","journal-title":"Ann Discrete Math"},{"key":"9235_CR6","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/j.tcs.2005.12.010","volume":"355","author":"C Simone De","year":"2006","unstructured":"De Simone C, Picinin de Mello C (2006) Edge colouring of join graphs. Theor Comp Sci 355:364\u2013370","journal-title":"Theor Comp Sci"},{"key":"9235_CR7","doi-asserted-by":"crossref","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 (2007) Edge-colouring of regular graphs of large degree. Theor Comp Sci 389:91\u201399","journal-title":"Theor Comp Sci"},{"key":"9235_CR8","doi-asserted-by":"crossref","unstructured":"De Simone C, Galluccio A (2009) Edge-colouring of joins of regular graphs, II. Manuscript","DOI":"10.1007\/s10878-009-9235-8"},{"key":"9235_CR9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0012-365X(71)90022-7","volume":"1","author":"D Werra De","year":"1972","unstructured":"De Werra D (1972) Investigations on an edge-coloring problem. Discrete Math 1:167\u2013179","journal-title":"Discrete Math"},{"key":"9235_CR10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/jgt.3190160207","volume":"16","author":"DG Hoffman","year":"1992","unstructured":"Hoffman DG, Rodger CA (1992) The chromatic index of complete multipartite graphs. J Graph Theory 16:159\u2013163","journal-title":"J Graph Theory"},{"key":"9235_CR11","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","volume":"14","author":"I Holyer","year":"1981","unstructured":"Holyer I (1981) The NP-completeness of edge-colouring. SIAM J Comput 14:718\u2013720","journal-title":"SIAM J Comput"},{"key":"9235_CR12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1093\/imamat\/9.1.23","volume":"9","author":"CJH McDiarmid","year":"1972","unstructured":"McDiarmid CJH (1972) The solution of a timetabling problem. J Inst Math Appl 9:23\u201334","journal-title":"J Inst Math Appl"},{"key":"9235_CR13","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02022041","volume":"4","author":"RH M\u00f6hring","year":"1985","unstructured":"M\u00f6hring RH (1985) Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions. Ann Oper Res 4:195\u2013225","journal-title":"Ann Oper Res"},{"key":"9235_CR14","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1142\/S0129054193000079","volume":"4","author":"S Nakano","year":"1993","unstructured":"Nakano S, Nishizeki T (1993) Scheduling file transfers under port and channel constraints. Int J Found Comput Sci 4:101\u2013115","journal-title":"Int J Found Comput Sci"},{"key":"9235_CR15","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/jgt.3190140211","volume":"14","author":"T Niessen","year":"1990","unstructured":"Niessen T, Volkmann L (1990) Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree. J Graph Theory 14:225\u2013246","journal-title":"J Graph Theory"},{"key":"9235_CR16","doi-asserted-by":"crossref","first-page":"#R7","DOI":"10.37236\/1551","volume":"8","author":"T Niessen","year":"2001","unstructured":"Niessen T (2001) How to find overfull subgraphs in graphs with large maximum degree, II. Electron J Comb 8:#R7","journal-title":"Electron J Comb"},{"key":"9235_CR17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"M Padberg","year":"1982","unstructured":"Padberg M, Rao MR (1982) Odd minimum cutsets and b-matchings. Math Oper Res 7:67\u201380","journal-title":"Math Oper Res"},{"key":"9235_CR18","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/S0012-365X(96)00202-6","volume":"165\/166","author":"L Perkovic","year":"1997","unstructured":"Perkovic L, Reed B (1997) Edge coloring regular graphs of high degree. Discrete Math 165\/166:567\u2013570","journal-title":"Discrete Math"},{"key":"9235_CR19","unstructured":"Perkovic L (1998) Edge coloring, polyhedra and probability. PhD Thesis, Carnegie Mellon University, US"},{"key":"9235_CR20","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1002\/jgt.3190050103","volume":"5","author":"M Plantholt","year":"1981","unstructured":"Plantholt M (1981) The chromatic class of graphs with a spanning star. J Graph Theory 5:5\u201313","journal-title":"J Graph Theory"},{"key":"9235_CR21","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing VG (1964) On an estimate of the chromatic class of a p-graph. Diskret Anal 3:25\u201330 (in Russian)","journal-title":"Diskret Anal"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9235-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9235-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9235-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T16:51:18Z","timestamp":1589820678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9235-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,23]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["9235"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9235-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,23]]}}}