{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T21:57:01Z","timestamp":1649023021151},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8447,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0166-218x(90)90070-s","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"267-276","source":"Crossref","is-referenced-by-count":0,"title":["Efficient algorithms for path partitions"],"prefix":"10.1016","volume":"27","author":[{"given":"Craig","family":"Williams","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dana","family":"Richards","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90070-S_BIB1","first-page":"82","volume":"20","author":"Arjomandi","year":"1982","journal-title":"An efficient algorithm for colouring the edges of a graph with \u0394 + 1 colours"},{"key":"10.1016\/0166-218X(90)90070-S_BIB2","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/0022-0000(84)90003-5","article-title":"Finding Euler tours in parallel","volume":"29","author":"Atallah","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(90)90070-S_BIB3","first-page":"249","article-title":"Finding Euler Circuits in Logarithmic Parallel Time","author":"Awerbuch","year":"1984","journal-title":"Proceedings 16th ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(90)90070-S_BIB4","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0166-218X(90)90070-S_BIB5","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90070-S_BIB6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0196-6774(87)90026-5","article-title":"Efficient parallel algorithms for edge coloring problems","volume":"8","author":"Karloff","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(90)90070-S_BIB7","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TC.1985.6312202","article-title":"The power of parallel prefix","volume":"34","author":"Kruskal","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(90)90070-S_BIB8","series-title":"Theory of Graphs","first-page":"231","article-title":"On covering of graphs","author":"Lov\u00e1sz","year":"1968"},{"key":"10.1016\/0166-218X(90)90070-S_BIB9","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1002\/jgt.3190050415","article-title":"A remark on the factor theorems of Lov\u00e1sz and Tutte","volume":"5","author":"Thomassen","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(90)90070-S_BIB10","first-page":"289","article-title":"The subgraph problem","volume":"3","author":"Tutte","year":"1978"},{"key":"10.1016\/0166-218X(90)90070-S_BIB11","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"Vizing","year":"1964","journal-title":"Diskret. Analiz."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090070S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090070S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:50:46Z","timestamp":1555131046000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090070S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["0166218X9090070S"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90070-s","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}