{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T01:50:19Z","timestamp":1713145819816},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T00:00:00Z","timestamp":1267401600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s00493-010-2483-5","type":"journal-article","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T08:27:14Z","timestamp":1284625634000},"page":"217-224","source":"Crossref","is-referenced-by-count":44,"title":["A fast algorithm for equitable coloring"],"prefix":"10.1007","volume":"30","author":[{"given":"Henry A.","family":"Kierstead","sequence":"first","affiliation":[]},{"given":"Alexandr V.","family":"Kostochka","sequence":"additional","affiliation":[]},{"given":"Marcelo","family":"Mydlarz","sequence":"additional","affiliation":[]},{"given":"Endre","family":"Szemer\u00e9di","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,17]]},"reference":[{"key":"2483_CR1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01271712","volume":"8","author":"N. Alon","year":"1992","unstructured":"N. Alon and Z. F\u00fcredi: Spanning subgraphs of random graphs, Graphs and Combinatorics 8 (1992), 91\u201394.","journal-title":"Graphs and Combinatorics"},{"key":"2483_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04363-9","volume-title":"Scheduling computer and manufacturing processes","author":"J. Blazewicz","year":"2001","unstructured":"J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt and J. Weglarz: Scheduling computer and manufacturing processes, 2nd ed., Springer, Berlin, 485 p. (2001).","edition":"2nd ed."},{"key":"2483_CR3","first-page":"601","volume-title":"Combinatorial Theory and its Application","author":"A. Hajnal","year":"1970","unstructured":"A. Hajnal and E. Szemer\u00e9di: Proof of a conjecture of P. Erd\u0151s, in: Combinatorial Theory and its Application (P. Erd\u0151s, A. R\u00e9nyi and V. T. S\u00f3s, eds.), pp. 601\u2013623, North-Holland, London, 1970."},{"key":"2483_CR4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/rsa.10031","volume":"20","author":"S. Janson","year":"2002","unstructured":"S. Janson and A. Ruci\u0144ski: The infamous upper tail, Random Structures and Algorithms 20 (2002), 317\u2013342.","journal-title":"Random Structures and Algorithms"},{"key":"2483_CR5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1017\/S0963548307008619","volume":"17","author":"H. A. Kierstead","year":"2008","unstructured":"H. A. Kierstead and A. V. Kostochka: A short proof of the Hajnal-Szemer\u00e9di Theorem on equitable coloring, Combinatorics, Probability and Computing 17 (2008), 265\u2013270.","journal-title":"Combinatorics, Probability and Computing"},{"key":"2483_CR6","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/j.jctb.2007.07.003","volume":"98","author":"H. A. Kierstead","year":"2008","unstructured":"H. A. Kierstead and A. V. Kostochka: An Ore-type theorem on equitable coloring, J. Combinatorial Theory Series B 98 (2008), 226\u2013234.","journal-title":"J. Combinatorial Theory Series B"},{"issue":"2","key":"2483_CR7","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/j.jctb.2008.06.007","volume":"99","author":"H. A. Kierstead","year":"2009","unstructured":"H. A. Kierstead and A. V. Kostochka: Ore-type versions of Brooks\u2019 theorem, J. Combinatorial Theory Series B 99(2) (2009), 298\u2013305.","journal-title":"J. Combinatorial Theory Series B"},{"key":"2483_CR8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1017\/S0963548306007899","volume":"16","author":"A. V. Kostochka","year":"2007","unstructured":"A. V. Kostochka and G. Yu: Ore-type graph packing problems, Combinatorics, Probability and Computing 16 (2007), 167\u2013169.","journal-title":"Combinatorics, Probability and Computing"},{"issue":"1","key":"2483_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01196135","volume":"17","author":"J. Koml\u00f3s","year":"1997","unstructured":"J. Koml\u00f3s, G. S\u00e1rk\u00f6zy and E. Szemer\u00e9di: Blow-Up Lemma, Combinatorica 17(1) (1997), 109\u2013123.","journal-title":"Combinatorica"},{"key":"2483_CR10","unstructured":"M. Mydlarz and E. Szemer\u00e9di: Algorithmic Brooks\u2019 Theorem, manuscript."},{"issue":"3","key":"2483_CR11","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s004930050063","volume":"19","author":"V. R\u00f6dl","year":"1999","unstructured":"V. R\u00f6dl and A. Ruci\u0144ski: Perfect matchings in \u025b-regular graphs and the Blow-Up Lemma, Combinatorica 19(3) (1999), 437\u2013452.","journal-title":"Combinatorica"},{"key":"2483_CR12","volume-title":"Domain decomposition; Parallel multilevel methods for elliptic partial differential equations","author":"B. F. Smith","year":"1996","unstructured":"B. F. Smith, P. E. Bjorstad and W. D. Gropp: Domain decomposition; Parallel multilevel methods for elliptic partial differential equations; Cambridge University Press, Cambridge, 224 p. (1996)."},{"key":"2483_CR13","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1137\/1015072","volume":"15","author":"A. Tucker","year":"1973","unstructured":"A. Tucker: Perfect graphs and an application to optimizing municipal services, SIAM Review 15 (1973), 585\u2013590.","journal-title":"SIAM Review"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2483-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-010-2483-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2483-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:47Z","timestamp":1559093567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-010-2483-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["2483"],"URL":"https:\/\/doi.org\/10.1007\/s00493-010-2483-5","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}