{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:55Z","timestamp":1725664315568},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540591757"},{"type":"electronic","value":"9783540492207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59175-3_96","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:05:05Z","timestamp":1330275905000},"page":"286-299","source":"Crossref","is-referenced-by-count":0,"title":["On edge-colouring indifference graphs"],"prefix":"10.1007","author":[{"given":"Celina M. H.","family":"Figueiredo","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o","family":"Meidanis","sequence":"additional","affiliation":[]},{"given":"C\u00e9lia Picinin","family":"Mello","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0166-218X(91)90010-T","volume":"30","author":"L. Cai","year":"1991","unstructured":"L. Cai and J. A. Ellis. NP-completeness of edge-colouring some restricted graphs. Discrete Applied Mathematics, 30:15\u201327, 1991.","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR2","unstructured":"C. M. H. de Figueiredo, J. Meidanis, and C. P. de Mello. A lexbfs algorithm for proper interval graph recognition. Technical report, Departamento de Ci\u00eancia da Computa\u00e7\u00e3o \u2014 UNICAMP, 1993."},{"key":"20_CR3","volume-title":"Edge-colourings of graphs","author":"S. Fiorini","year":"1977","unstructured":"S. Fiorini and R.J. Wilson. Edge-colourings of graphs. Pitman, London, 1977."},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0012-365X(89)90198-2","volume":"74","author":"A. J. W. Hilton","year":"1989","unstructured":"A. J. W. Hilton. Two conjectures on edge-colouring. Discrete Math., 74:61\u201364, 1989.","journal-title":"Discrete Math."},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/jgt.3190160207","volume":"16","author":"D. G. Hoffman","year":"1992","unstructured":"D. G. Hoffman and C. A. Rodger. The chromatic index of complete multipartite graphs. J. of Graph Theory, 16:159\u2013163, 1992.","journal-title":"J. of Graph Theory"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"I. Holyer. The NP-completeness of edge-coloring. SIAM J. Comput., 10:718\u2013720, 1981.","journal-title":"SIAM J. Comput."},{"key":"20_CR7","volume-title":"PhD thesis","author":"C. Ortiz","year":"1994","unstructured":"C. Ortiz. Sobre colora\u00e7\u00e3o de arestas. PhD thesis, COPPE-UFRJ, Rio de Janeiro, 1994. In Portuguese."},{"key":"20_CR8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"M. W. Padberg","year":"1982","unstructured":"M. W. Padberg and M. R. Rao. Odd minimum cut-sets ans b-matching. Math. Oper. Res., 7:67\u201380, 1982.","journal-title":"Math. Oper. Res."},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/jgt.3190050103","volume":"5","author":"M. Plantholt","year":"1981","unstructured":"M. Plantholt. The chromatic index of graphs with a spanning star. J. of Graph Theory, 5:45\u201353, 1981.","journal-title":"J. of Graph Theory"},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0012-365X(83)90074-2","volume":"47","author":"M. Plantholt","year":"1983","unstructured":"M. Plantholt. The chromatic index of graphs with large maximum degree. Discrete Math., 47:91\u201396, 1983.","journal-title":"Discrete Math."},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/0095-8956(71)90010-4","volume":"11","author":"F. S. Roberts","year":"1971","unstructured":"F. S. Roberts. On the compatibility between a graph and a simple order. J. Comb. Theory (B), 11:28\u201338, 1971.","journal-title":"J. Comb. Theory (B)"},{"key":"20_CR12","first-page":"25","volume":"3","author":"V. G. Vizing","year":"1964","unstructured":"V. G. Vizing. On an estimate of the chromatic class of a p-graph. Diket. Analiz., 3:25\u201330, 1964. In russian.","journal-title":"Diket. Analiz."}],"container-title":["Lecture Notes in Computer Science","LATIN '95: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59175-3_96.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:24:24Z","timestamp":1619573064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59175-3_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540591757","9783540492207"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-59175-3_96","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}