{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:44:58Z","timestamp":1780386298212,"version":"3.54.1"},"reference-count":20,"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-2420-7","type":"journal-article","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T04:27:14Z","timestamp":1284611234000},"page":"201-216","source":"Crossref","is-referenced-by-count":15,"title":["Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture"],"prefix":"10.1007","volume":"30","author":[{"given":"Henry A.","family":"Kierstead","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexandr V.","family":"Kostochka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,9,17]]},"reference":[{"key":"2420_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":"2420_CR2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02350627","volume":"8","author":"N. Alon","year":"1992","unstructured":"N. Alon and R. Yuster: Almost H-factors in dense graphs, Graphs and Combinatorics 8 (1992), 95\u2013102.","journal-title":"Graphs and Combinatorics"},{"key":"2420_CR3","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":"2420_CR4","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":"2420_CR5","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R. L. Brooks","year":"1941","unstructured":"R. L. Brooks: On coloring the nodes of a network, Proc. Cambridge Phil. Soc. 37 (1941), 194\u2013197.","journal-title":"Proc. Cambridge Phil. Soc."},{"key":"2420_CR6","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":"2420_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G. Dirac","year":"1952","unstructured":"G. Dirac: Some theorems on abstract graphs, Proc. London Math. Soc. 2 (1952), 69\u201381.","journal-title":"Proc. London Math. Soc."},{"key":"2420_CR8","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":"2420_CR9","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":"2420_CR10","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, Combin., Prob. and Comput. 17 (2008), 265\u2013270.","journal-title":"Combin., Prob. and Comput."},{"key":"2420_CR11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01626028","volume":"1","author":"J. Koml\u00f3s","year":"1998","unstructured":"J. Koml\u00f3s, G. S\u00e1rk\u00f6zy and E. Szemer\u00e9di: Proof of the Seymour conjecture for large graphs, Annals of Combinatorics 1 (1998), 43\u201360.","journal-title":"Annals of Combinatorics"},{"key":"2420_CR12","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":"2420_CR13","unstructured":"A. V. Kostochka and G. Yu: Extremal problems on packing of graphs, Oberwolfach Reports No. 1 (2006), 55\u201357."},{"key":"2420_CR14","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":"2420_CR15","doi-asserted-by":"crossref","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), pp. 285\u2013296, 2001.","DOI":"10.1007\/3-540-44666-4_31"},{"issue":"3","key":"2420_CR16","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":"2420_CR17","volume-title":"Domain decomposition; Parallel multilevel methods for elliptic partial differential equations","author":"B. F. Smith","year":"1996","unstructured":"B. F. Smith, P. E. Bj\u00f8stad and W. D. Gropp: Domain decomposition; Parallel multilevel methods for elliptic partial differential equations, Cambridge University Press, Cambridge, 224 p. (1996)."},{"key":"2420_CR18","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":"2420_CR19","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":"2420_CR20","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-010-2420-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-010-2420-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2420-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:47Z","timestamp":1559079167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-010-2420-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["2420"],"URL":"https:\/\/doi.org\/10.1007\/s00493-010-2420-7","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}