{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T20:11:02Z","timestamp":1667419862825},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T00:00:00Z","timestamp":1540339200000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00373-018-1965-x","type":"journal-article","created":{"date-parts":[[2018,10,24]],"date-time":"2018-10-24T12:23:13Z","timestamp":1540383793000},"page":"1637-1649","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Total Equitable List Coloring"],"prefix":"10.1007","volume":"34","author":[{"given":"Hemanshu","family":"Kaul","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey A.","family":"Mudrock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Pelsmajer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,24]]},"reference":[{"key":"1965_CR1","unstructured":"Behzad, M.: Graphs and their chromatic numbers, Ph.D. Thesis, Michigan State University (1965)"},{"key":"1965_CR2","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1006\/jctb.1997.1780","volume":"71","author":"OV Borodin","year":"1997","unstructured":"Borodin, O.V., Kostochka, A.V., Woodall, D.R.: List edge and list total colourings of multigraphs. J. Comb. Theory Ser. B 71, 184\u2013204 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1965_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks, R.L.: On coloring the nodes of a network. Proc. Camb. Philos. Soc. 37, 194\u2013197 (1941)","journal-title":"Proc. Camb. Philos. Soc."},{"key":"1965_CR4","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. Comb. 15, 443\u2013447 (1994)","journal-title":"Eur. J. Comb."},{"key":"1965_CR5","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1016\/j.dam.2008.08.030","volume":"157","author":"T Chunling","year":"2009","unstructured":"Chunling, T., Xiaohui, L., Yuansheng, Y., Zhihe, L.: Equitable total coloring of \n                    \n                      \n                    \n                    $$C_m \\square C_n$$\n                    \n                      \n                        \n                          \n                            C\n                            m\n                          \n                          \u25a1\n                          \n                            C\n                            n\n                          \n                        \n                      \n                    \n                  . Discret. Appl. Math. 157, 596\u2013601 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"1965_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.7151\/dmgt.1438","volume":"29","author":"DW Cranston","year":"2009","unstructured":"Cranston, D.W.: Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles. Discuss. Math. Graph Theory 29(1), 163\u2013178 (2009)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1965_CR7","unstructured":"Erd\u0151s, P.: Problem 9. In: Fiedler, M. (ed.) Theory of Graphs and Its Applications. Proceedings Symposium, Smolenice, 1963. Publishing House Czechoslovak Acad. Sci, Prague, pp. 159 (1964)"},{"key":"1965_CR8","first-page":"125","volume":"26","author":"P Erd\u0151s","year":"1979","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Cong. Numer. 26, 125\u2013127 (1979)","journal-title":"Cong. Numer."},{"key":"1965_CR9","first-page":"111","volume":"102","author":"H-L Fu","year":"1994","unstructured":"Fu, H.-L.: Some results on equalized total coloring. Cong. Numer. 102, 111\u2013119 (1994)","journal-title":"Cong. Numer."},{"key":"1965_CR10","unstructured":"Furma\u0144czyk, H.: Equitable total coloring of corona of cubic graphs. \n                    arxiv:1504.04869\n                    \n                   submitted 2015"},{"key":"1965_CR11","unstructured":"Gang, M.A., Ming, M.A.: The equitable chromatic number of some join graphs. Open J. Appl. Sci. 2, 96\u201399 (2012)"},{"key":"1965_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10255-006-6031-4","volume":"25","author":"K Gong","year":"2009","unstructured":"Gong, K., Zhang, Z., Wang, J.: Equitable total coloring of \n                    \n                      \n                    \n                    $$F_n \\vee W_n$$\n                    \n                      \n                        \n                          \n                            F\n                            n\n                          \n                          \u2228\n                          \n                            W\n                            n\n                          \n                        \n                      \n                    \n                  . Acta Mathematicae Applicante Sinica Engl. Ser. 25, 83\u201386 (2009)","journal-title":"Acta Mathematicae Applicante Sinica Engl. Ser."},{"key":"1965_CR13","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, Netherlands (1970)"},{"key":"1965_CR14","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":"1965_CR15","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10107-006-0719-3","volume":"108","author":"H Kaul","year":"2006","unstructured":"Kaul, H., Jacobson, S.H.: New global optima results for the Kauffman \n                    \n                      \n                    \n                    $$NK$$\n                    \n                      \n                        \n                          NK\n                        \n                      \n                    \n                   model: handling dependency. Math. Program. 108, 475\u2013494 (2006). (Special issue on \u2018Optimization under Uncertainty)","journal-title":"Math. Program."},{"key":"1965_CR16","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-Lih-Wu conjecture. Combinatorica 2, 201\u2013216 (2010)","journal-title":"Combinatorica"},{"key":"1965_CR17","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.21710","volume":"74","author":"HA Kierstead","year":"2013","unstructured":"Kierstead, H.A., Kostochka, A.V.: Equitable list coloring of graphs with bounded degree. J. Gr. Theory 74, 309\u2013334 (2013)","journal-title":"J. Gr. Theory"},{"key":"1965_CR18","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/jgt.21802","volume":"78","author":"S-J Kim","year":"2015","unstructured":"Kim, S.-J., Park, B.: Counterexamples to the list square coloring conjecture. J. Gr. Theory 78, 239\u2013247 (2015)","journal-title":"J. Gr. Theory"},{"key":"1965_CR19","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0012-365X(00)00371-X","volume":"240","author":"AV Kostochka","year":"2001","unstructured":"Kostochka, A.V., Woodall, D.R.: Choosability conjectures and multicircuits. Discret. Math. 240, 123\u2013143 (2001)","journal-title":"Discret. Math."},{"key":"1965_CR20","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1002\/jgt.10029","volume":"40","author":"AV Kostochka","year":"2002","unstructured":"Kostochka, A.V., Woodall, D.R.: Total choosability of multicircuits I. J. Gr. Theory 40, 26\u201343 (2002)","journal-title":"J. Gr. Theory"},{"key":"1965_CR21","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1002\/jgt.10030","volume":"40","author":"AV Kostochka","year":"2002","unstructured":"Kostochka, A.V., Woodall, D.R.: Total choosability of multicircuits II. J. Gr. Theory 40, 44\u201367 (2002)","journal-title":"J. Gr. Theory"},{"key":"1965_CR22","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":"1965_CR23","unstructured":"Leidner, M.E.: A study of the total colorings of graphs, Ph.D. Thesis, University of Louisville (2012)"},{"key":"1965_CR24","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.disc.2007.12.070","volume":"309","author":"Q Li","year":"2009","unstructured":"Li, Q., Bu, Y.: Equitable list coloring of planar graphs without 4- and 6-cycles. Discret. Math. 309, 280\u2013287 (2009)","journal-title":"Discret. Math."},{"key":"1965_CR25","doi-asserted-by":"publisher","first-page":"2158","DOI":"10.1016\/j.disc.2011.06.031","volume":"311","author":"R Li","year":"2011","unstructured":"Li, R., Xu, B.: Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles. Discret. Math. 311, 2158\u20132163 (2011)","journal-title":"Discret. Math."},{"key":"1965_CR26","first-page":"543","volume-title":"Handbook of Combinatorial Optimization","author":"K-W Lih","year":"1998","unstructured":"Lih, K.-W.: The equitable coloring of graphs. In: Du, D.-Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, vol. III, pp. 543\u2013566. Kluwer, Dordrecht (1998)"},{"key":"1965_CR27","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. Discret. Math. 151, 155\u2013160 (1996)","journal-title":"Discret. Math."},{"key":"1965_CR28","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1016\/j.disc.2012.11.026","volume":"313","author":"Q Lu","year":"2013","unstructured":"Lu, Q., Miao, Z., Wang, Y.: Sufficient conditions for a planar graph to be list edge \n                    \n                      \n                    \n                    $$\\Delta $$\n                    \n                      \n                        \u0394\n                      \n                    \n                  -colorable and list totally \n                    \n                      \n                    \n                    $$(\\Delta +1)$$\n                    \n                      \n                        \n                          (\n                          \u0394\n                          +\n                          1\n                          )\n                        \n                      \n                    \n                  -colorable. Discret. Math. 313, 575\u2013580 (2013)","journal-title":"Discret. Math."},{"key":"1965_CR29","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":"1965_CR30","unstructured":"Mudrock, J.: On the list coloring problem and its equitable variants, Ph.D. Thesis, Illinois Institute of Technology (2018)"},{"key":"1965_CR31","unstructured":"Nakprasit, K.: Personal Communication (2002)"},{"issue":"2","key":"1965_CR32","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1002\/jgt.10033","volume":"40","author":"K Ohba","year":"2002","unstructured":"Ohba, K.: On chromatic-choosable graphs. J. Gr. Theory 40(2), 130\u2013135 (2002)","journal-title":"J. Gr. Theory"},{"key":"1965_CR33","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":"1965_CR34","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00373-002-0486-8","volume":"19","author":"A Prowse","year":"2003","unstructured":"Prowse, A., Woodall, D.R.: Choosability of powers of circuits. Gr. Comb. 19, 137\u2013144 (2003)","journal-title":"Gr. Comb."},{"key":"1965_CR35","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."},{"issue":"6","key":"1965_CR36","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1070\/RM1968v023n06ABEH001252","volume":"23","author":"V G Vizing","year":"1968","unstructured":"Vizing, V.G.: Some unsolved problems in graph theory (Russian). Ups. Mat. Nauk. 23, 117\u2013134 (1968). English Translation in Russian Math. Surveys 23, 125\u2013141 (1968)","journal-title":"Russian Mathematical Surveys"},{"key":"1965_CR37","unstructured":"Vizing, V.G.: Coloring the vertices of a graph in prescribed colors. Diskret. Analiz. no. 29, Metody Diskret. Anal. v Teorii Kodovi Skhem 101, 3\u201310 (1976)"},{"key":"1965_CR38","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s003730200051","volume":"18","author":"W Wang","year":"2002","unstructured":"Wang, W.: Equitable total coloring of graphs with maximum degree 3. Gr. Comb. 18, 677\u2013685 (2002)","journal-title":"Gr. Comb."},{"key":"1965_CR39","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/s10878-015-9870-1","volume":"32","author":"H Wang","year":"2016","unstructured":"Wang, H., Liu, B., Zhang, X., Wu, L., Gao, H.: List edge and list total coloring of planar graphs with maximum degree 8. J. Comb. Optim. 32, 188\u2013197 (2016)","journal-title":"J. Comb. Optim."},{"key":"1965_CR40","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River, NJ (2001)"},{"key":"1965_CR41","first-page":"143","volume":"25","author":"HP Yap","year":"1997","unstructured":"Yap, H.P., Zhang, Y.: The equitable \n                    \n                      \n                    \n                    $$\\Delta $$\n                    \n                      \n                        \u0394\n                      \n                    \n                  -coloring conjecture holds for outerplanar graphs. Bull. Inst. Acad. Sinica 25, 143\u2013149 (1997)","journal-title":"Bull. Inst. Acad. Sinica"},{"key":"1965_CR42","first-page":"829","volume":"2","author":"Z Zhang","year":"2005","unstructured":"Zhang, Z., Wang, W., Bau, S., Li, J.: On the equitable total colorings of some join graphs. J. Inf. Comput. Sci. 2, 829\u2013834 (2005)","journal-title":"J. Inf. Comput. Sci."},{"key":"1965_CR43","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1016\/j.disc.2011.02.001","volume":"311","author":"X Zhang","year":"2011","unstructured":"Zhang, X., Wu, J.-L.: On equitable and equitable list colorings of series-parallel graphs. Discret. Math. 311, 800\u2013803 (2011)","journal-title":"Discret. Math."},{"key":"1965_CR44","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2008.04.018","volume":"407","author":"J Zhu","year":"2008","unstructured":"Zhu, J., Bu, Y.: Equitable list coloring of planar graphs without short cycles. Theor. Comput. Sci. 407, 21\u201328 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"1965_CR45","doi-asserted-by":"publisher","first-page":"3873","DOI":"10.1016\/j.tcs.2010.06.027","volume":"411","author":"J Zhu","year":"2010","unstructured":"Zhu, J., Bu, Y.: Equitable and equitable list colorings of graphs. Theor. Comput. Sci. 411, 3873\u20133876 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"1965_CR46","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s00373-013-1396-7","volume":"31","author":"J Zhu","year":"2015","unstructured":"Zhu, J., Bu, Y., Min, X.: Equitable list-coloring for \n                    \n                      \n                    \n                    $$C_5$$\n                    \n                      \n                        \n                          C\n                          5\n                        \n                      \n                    \n                  -free plane graphs without adjacent triangles. Gr. Comb. 31, 795\u2013804 (2015)","journal-title":"Gr. Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1965-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1965-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1965-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T00:24:06Z","timestamp":1571876646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1965-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,24]]},"references-count":46,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1965"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1965-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,24]]},"assertion":[{"value":"19 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}