{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:45:49Z","timestamp":1780386349231,"version":"3.54.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,8,5]],"date-time":"2014-08-05T00:00:00Z","timestamp":1407196800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s00493-014-3059-6","type":"journal-article","created":{"date-parts":[[2014,8,5]],"date-time":"2014-08-05T01:03:12Z","timestamp":1407200592000},"page":"497-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A refinement of a result of Corr\u00e1di and Hajnal"],"prefix":"10.1007","volume":"35","author":[{"given":"H. A.","family":"Kierstead","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. V.","family":"Kostochka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,8,5]]},"reference":[{"key":"3059_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":"3059_CR2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1006\/jctb.1996.0020","volume":"66","author":"N. Alon","year":"1996","unstructured":"N. Alon and R. Yuster: H-factors in dense graphs, J. Combinatorial Theory, Ser. B 66 (1996), 269\u2013282.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"3059_CR3","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., Berlin, Springer, (2001).","edition":"2nd ed."},{"key":"3059_CR4","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1006\/eujc.1994.1047","volume":"15","author":"B.-L. Chen","year":"1994","unstructured":"B.-L. Chen, K.-W. Lih and P.-L. Wu: Equitable coloring and the maximum degree, Europ. J. Combinatorics 15 (1994), 443\u2013447.","journal-title":"Europ. J. Combinatorics"},{"key":"3059_CR5","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF01895727","volume":"14","author":"K. Corr\u00e1di","year":"1963","unstructured":"K. Corr\u00e1di and A. Hajnal: On the maximal number of independent circuits in a graph, Acta Math. Acad. Sci. Hungar. 14 (1963), 423\u2013439.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"3059_CR6","first-page":"601","volume-title":"Combinatorial Theory and its Application","author":"A. Hajnal","year":"1990","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.), 601\u2013623, North-Holland, London, 1990."},{"key":"3059_CR7","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":"3059_CR8","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":"3059_CR9","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"},{"key":"3059_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s00493-010-2420-7","volume":"30","author":"H. A. Kierstead","year":"2010","unstructured":"H. A. Kierstead and A. V. Kostochka: Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture, Combinatorica 30 (2010), 201\u2013216.","journal-title":"Combinatorica"},{"key":"3059_CR11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/jgt.20630","volume":"71","author":"H. A. Kierstead","year":"2012","unstructured":"H. A. Kierstead and A. V. Kostochka: Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring, J. Graph Theory 71 (2012), 31\u201348.","journal-title":"J. Graph Theory"},{"key":"3059_CR12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s00493-010-2483-5","volume":"30","author":"H. A. Kierstead","year":"2010","unstructured":"H. A. Kierstead, A. V. Kostochka, M. Mydlarz and E. Szemer\u00e9di: A fast algorithm for equitable coloring, Combinatorica 30 (2010), 217\u2013224.","journal-title":"Combinatorica"},{"key":"3059_CR13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1017\/CBO9781107325975.006","volume-title":"Surveys in Combinatorics 2009","author":"H. A. Kierstead","year":"2009","unstructured":"H. A. Kierstead, A. V. Kostochka and G. Yu: Extremal graph packing problems: Ore-type versus Dirac-type, in: Surveys in Combinatorics 2009 (eds.S. Huczynska, J. Mitchell and C. Roney-Dougal), London Mathematical Society Lecture Note Series 365, Cambridge University Press, Cambridge (2009) 113\u2013136."},{"key":"3059_CR14","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1002\/jgt.10137","volume":"44","author":"A. V. Kostochka","year":"2003","unstructured":"A. V. Kostochka, M. Pelsmajer and D. B. West: A list analogue of equitable coloring, J. Graph Theory 44 (2003), 166\u2013177.","journal-title":"J. Graph Theory"},{"key":"3059_CR15","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.tcs.2005.09.031","volume":"349","author":"A. V. Kostochka","year":"2005","unstructured":"A. V. Kostochka and K. Nakprasit: On equitable \u0394-coloring of graphs with low average degree, Theor. Comp. Sci. 349 (2005), 82\u201391.","journal-title":"Theor. Comp. Sci."},{"key":"3059_CR16","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0012-365X(94)00092-W","volume":"151","author":"K.-W. Lih","year":"1996","unstructured":"K.-W. Lih and P.-L. Wu: On equitable coloring of bipartite graphs, Discrete Math. 151 (1996), 155\u2013160.","journal-title":"Discrete Math."},{"key":"3059_CR17","first-page":"285","volume-title":"Proceedings of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX-RANDOM 2001)","author":"S. V. Pemmaraju","year":"2001","unstructured":"S. V. Pemmaraju: Equitable colorings extend Chernoff-Hoeffding bounds, in: Proceedings of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX-RANDOM 2001), 2001, 285\u2013296."},{"key":"3059_CR18","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 \u03b5-regular graphs and the blow-up lemma, Combinatorica 19 (1999), 437\u2013452.","journal-title":"Combinatorica"},{"key":"3059_CR19","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 Cambridge University Press, (1996)."},{"key":"3059_CR20","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"},{"key":"3059_CR21","first-page":"143","volume":"5","author":"H.-P. Yap","year":"1997","unstructured":"H.-P. Yap and Y. Zhang: The equitable \u0394-colouring conjecture holds for outerplanar graphs, Bull. Inst. Math. Acad. Sin. 5 (1997), 143\u2013149.","journal-title":"Bull. Inst. Math. Acad. Sin."},{"key":"3059_CR22","first-page":"97","volume":"27","author":"H.-P. Yap","year":"1998","unstructured":"H.-P. Yap and Y. Zhang: Equitable colourings of planar graphs, J. Comb.Math. Comb.Comp. 27 (1998), 97\u2013105.","journal-title":"J. Comb.Math. Comb.Comp."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3059-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-3059-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-3059-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:51Z","timestamp":1559079171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-3059-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,5]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["3059"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-3059-6","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,5]]}}}