{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:57:49Z","timestamp":1762300669297},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T00:00:00Z","timestamp":1715644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T00:00:00Z","timestamp":1715644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s00493-024-00106-2","type":"journal-article","created":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T14:01:58Z","timestamp":1715695318000},"page":"1063-1068","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["List-k-Coloring H-Free Graphs for All $$k>4$$"],"prefix":"10.1007","volume":"44","author":[{"given":"Maria","family":"Chudnovsky","sequence":"first","affiliation":[]},{"given":"Sepehr","family":"Hajebi","sequence":"additional","affiliation":[]},{"given":"Sophie","family":"Spirkl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,14]]},"reference":[{"issue":"1","key":"106_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00453-013-9777-0","volume":"71","author":"J-F Couturier","year":"2015","unstructured":"Couturier, J.-F., Golovach, P.A., Kratsch, D., Paulusma, D.: List coloring in the absence of a linear forest. Algorithmica 71(1), 21\u201335 (2015)","journal-title":"Algorithmica"},{"issue":"2\u20133","key":"106_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(86)90184-2","volume":"43","author":"K Edwards","year":"1986","unstructured":"Edwards, K.: The complexity of colouring problems on dense graphs. Theoret. Comput. Sci. 43(2\u20133), 337\u2013343 (1986)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"106_CR3","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1002\/jgt.22028","volume":"84","author":"PA Golovach","year":"2017","unstructured":"Golovach, P.A., Johnson, M., Paulusma, D., Song, J.: A survey on the computational complexity of coloring graphs with forbidden subgraphs. J. Graph Theory 84(4), 331\u2013363 (2017)","journal-title":"J. Graph Theory"},{"issue":"3","key":"106_CR4","doi-asserted-by":"publisher","first-page":"2004","DOI":"10.1137\/21M1443352","volume":"36","author":"S Hajebi","year":"2022","unstructured":"Hajebi, S., Li, Y., Spirkl, S.: Complexity dichotomy for list-5-coloring with a forbidden induced subgraph. SIAM J. Discrete Math. 36(3), 2004\u20132027 (2022)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"106_CR5","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"106_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"106_CR7","first-page":"61","volume":"2","author":"M Kami\u0144ski","year":"2007","unstructured":"Kami\u0144ski, M., Lozin, V.: Coloring edges and vertices of graphs without short or long cycles. Contrib. Discrete Math. 2(1), 61\u201366 (2007)","journal-title":"Contrib. Discrete Math."},{"key":"106_CR8","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems (1972). In: Ideas that Created the Future\u2014Classic Papers of Computer Science, pp. 349\u2013356. MIT Press, Cambridge (2021)","DOI":"10.7551\/mitpress\/12274.003.0038"},{"issue":"1","key":"106_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","volume":"4","author":"D Leven","year":"1983","unstructured":"Leven, D., Galil, Z.: NP completeness of finding the chromatic index of regular graphs. J. Algorithms 4(1), 35\u201344 (1983)","journal-title":"J. Algorithms"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00106-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-024-00106-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00106-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T12:09:22Z","timestamp":1728302962000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-024-00106-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,14]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["106"],"URL":"https:\/\/doi.org\/10.1007\/s00493-024-00106-2","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[2024,5,14]]},"assertion":[{"value":"9 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}