{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:13Z","timestamp":1740107113076,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T00:00:00Z","timestamp":1663804800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T00:00:00Z","timestamp":1663804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00373-022-02571-2","type":"journal-article","created":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T17:08:51Z","timestamp":1663866531000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Equitable Choosability of the Disjoint Union of Stars"],"prefix":"10.1007","volume":"38","author":[{"given":"Hemanshu","family":"Kaul","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9527-9363","authenticated-orcid":false,"given":"Jeffrey A.","family":"Mudrock","sequence":"additional","affiliation":[]},{"given":"Tim","family":"Wagstrom","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,22]]},"reference":[{"key":"2571_CR1","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1006\/eujc.1994.1047","volume":"15","author":"B-L Chen","year":"1994","unstructured":"Chen, B.-L., Lih, K.-W., Wu, P.-L.: Equitable coloring and the maximum degree. Eur. J. Combin. 15, 443\u2013447 (1994)","journal-title":"Eur. J. Combin."},{"key":"2571_CR2","unstructured":"Erd\u0151s, P.: Problem 9, In: M. Fiedler, editor, Theory of Graphs and Its Applications, Proc. Sympos., Smolenice, 1963, Publ. House Czechoslovak Acad. Sci. Prague, 159 (1964)"},{"key":"2571_CR3","first-page":"125","volume":"26","author":"P Erd\u0151s","year":"1979","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Congressus Numerantium 26, 125\u2013127 (1979)","journal-title":"Congressus Numerantium"},{"key":"2571_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2005.09.027","volume":"349","author":"HL Bodlaender","year":"2005","unstructured":"Bodlaender, H.L., Fomin, F.V.: Equitable colorings of bounded treewidth graphs. Theor. Comput. Sci. 349, 22\u201330 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"2571_CR5","volume-title":"Comupters and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Comupters and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Company, New York (1979)"},{"key":"2571_CR6","first-page":"601","volume-title":"Combinatorial Theory and Its Applications","author":"A Hajn\u00e1l","year":"1970","unstructured":"Hajn\u00e1l, A., Szemer\u00e9di, E.: Proof of a conjecture of Erd\u0151s. In: R\u00e9nyi, A., S\u00f3s, V.T. (eds.) Combinatorial Theory and Its Applications, vol. II, pp. 601\u2013623. North-Holland, Amsterdam (1970)"},{"key":"2571_CR7","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1002\/rsa.10031","volume":"20","author":"S Janson","year":"2002","unstructured":"Janson, S., Ruci\u0144ski, A.: The infamous upper tail. Random Struct. Algorithms 20, 317\u2013342 (2002)","journal-title":"Random Struct. Algorithms"},{"key":"2571_CR8","doi-asserted-by":"crossref","unstructured":"Kaul, H., Jacobson, S.H.: New Global Optima Results for the Kauffman $$NK$$ Model: Handling Dependency, Mathematical Programming, Special issue on \u2018Optimization under Uncertainty\u2019, Volume 108 475-494 (2006)","DOI":"10.1007\/s10107-006-0719-3"},{"key":"2571_CR9","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1007\/s00373-018-1965-x","volume":"34","author":"H Kaul","year":"2018","unstructured":"Kaul, H., Mudrock, J.A., Pelsmajer, M.J.: Total equitable list coloring. Graphs Combinat. 34, 1637\u20131649 (2018)","journal-title":"Graphs Combinat."},{"key":"2571_CR10","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s00373-020-02146-z","volume":"36","author":"H Kaul","year":"2020","unstructured":"Kaul, H., Mudrock, J., Pelsmajer, M.J., Reiniger, B.: A simple characterization of proportionally 2-choosable graphs. Gr. Comb. 36, 679\u2013687 (2020)","journal-title":"Gr. Comb."},{"key":"2571_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00493-010-2420-7","volume":"2","author":"HA Kierstead","year":"2010","unstructured":"Kierstead, H.A., Kostochka, A.V.: Equitable versus nearly equitable coloring and the Chen\u2013Lih\u2013Wu conjecture. Combinatorica 2, 201\u2013216 (2010)","journal-title":"Combinatorica"},{"key":"2571_CR12","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/jgt.10137","volume":"44","author":"AV Kostochka","year":"2003","unstructured":"Kostochka, A.V., Pelsmajer, M.J., West, D.B.: A list analogue of equitable coloring. J. Gr. Theory 44, 166\u2013177 (2003)","journal-title":"J. Gr. Theory"},{"key":"2571_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0012-365X(94)00092-W","volume":"151","author":"K-W Lih","year":"1996","unstructured":"Lih, K.-W., Wu, P.-L.: On equitable coloring of bipartite graphs. Discrete Math. 151, 155\u2013160 (1996)","journal-title":"Discrete Math."},{"key":"2571_CR14","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1080\/00029890.1973.11993408","volume":"80","author":"W Meyer","year":"1973","unstructured":"Meyer, W.: Equitable coloring. Am. Math. Mon. 80, 920\u2013922 (1973)","journal-title":"Am. Math. Mon."},{"key":"2571_CR15","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.7151\/dmgt.2232","volume":"41","author":"J Mudrock","year":"2021","unstructured":"Mudrock, J., Chase, M., Kadera, I., Wagstrom, T.: A note on the equitable choosability of complete bipartite graphs. Discuss. Math. Gr. Theory 41, 1091\u20131101 (2021)","journal-title":"Discuss. Math. Gr. Theory"},{"key":"2571_CR16","doi-asserted-by":"crossref","unstructured":"Pemmaraju, S.V.: Equitable colorings extend Chernoff\u2013Hoeffding 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"},{"key":"2571_CR17","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1137\/1015072","volume":"15","author":"A Tucker","year":"1973","unstructured":"Tucker, A.: Perfect graphs and an application to optimizing municipal services. SIAM Rev. 15, 585\u2013590 (1973)","journal-title":"SIAM Rev."},{"key":"2571_CR18","unstructured":"Vizing, V.G.: Coloring the vertices of a graph in prescribed colors. Diskret. Analiz. no. 29, Metody Diskret. Anal. v Teorii Kodovi Skhem vol. 101, pp. 3\u201310 (1976)"},{"key":"2571_CR19","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2001)"},{"key":"2571_CR20","first-page":"143","volume":"25","author":"HP Yap","year":"1997","unstructured":"Yap, H.P., Zhang, Y.: The equitable $$\\Delta $$-coloring conjecture holds for outerplanar graphs. Bull. Inst. Acad. Sin. 25, 143\u2013149 (1997)","journal-title":"Bull. Inst. Acad. Sin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02571-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02571-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02571-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T19:46:24Z","timestamp":1667418384000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02571-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,22]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["2571"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02571-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,9,22]]},"assertion":[{"value":"22 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"163"}}