{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T13:48:22Z","timestamp":1648820902393},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,5,13]],"date-time":"2015-05-13T00:00:00Z","timestamp":1431475200000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10878-015-9895-5","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T05:07:28Z","timestamp":1431407248000},"page":"725-740","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Shasha","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liancui","family":"Zuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,13]]},"reference":[{"issue":"2","key":"9895_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(96)00031-X","volume":"162","author":"B Baker","year":"1996","unstructured":"Baker B, Coffman E (1996) Mutual exclusion scheduling. Theore Comput Sci 162(2):225\u2013243","journal-title":"Theore Comput Sci"},{"issue":"2","key":"9895_CR2","first-page":"75","volume":"15","author":"D Blum","year":"2003","unstructured":"Blum D, Torrey D, Hammack R (2003) Equitable chromatic number of complete multipartite graphs. Mo J Math Sci 15(2):75\u201381","journal-title":"Mo J Math Sci"},{"key":"9895_CR3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0095-8956(83)90017-5","volume":"34","author":"B Bollob\u00e1s","year":"1983","unstructured":"Bollob\u00e1s B, Guy RK (1983) Equitable and proportional coloring of trees. J Comb Theory, B 34:177\u2013186","journal-title":"J Comb Theory, B"},{"key":"9895_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications. The Macmillan press LTD, New York"},{"key":"9895_CR5","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1016\/j.ejc.2008.09.017","volume":"30","author":"GJ Chang","year":"2009","unstructured":"Chang GJ (2009) A note on equitable colorings of forests. Eur J Comb 30:809\u2013812","journal-title":"Eur J Comb"},{"issue":"1","key":"9895_CR6","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/jctb.1994.1032","volume":"61","author":"BL Chen","year":"1994","unstructured":"Chen BL, Lih KW (1994) Equitable coloring of trees. J Comb Theory Ser B 61(1):83\u201387","journal-title":"J Comb Theory Ser B"},{"key":"9895_CR7","doi-asserted-by":"crossref","first-page":"1512","DOI":"10.1016\/j.disc.2011.05.020","volume":"312","author":"BL Chen","year":"2012","unstructured":"Chen BL, Yen CH (2012) Equitale $$\\Delta $$ \u0394 -coloring of graphs. Discret Math 312:1512\u20131517","journal-title":"Discret Math"},{"issue":"5","key":"9895_CR8","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1006\/eujc.1994.1047","volume":"15","author":"BL Chen","year":"1994","unstructured":"Chen BL, Lih KW, Wu PL (1994) Equitable coloring and the maximum degree. Eur J Comb 15(5):443\u2013447","journal-title":"Eur J Comb"},{"key":"9895_CR9","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10878-011-9429-8","volume":"25","author":"BL Chen","year":"2013","unstructured":"Chen BL, Lih KW, Yen CH (2013) Equivalence of two conjectures on equitable coloring of graphs. J Comb Optim 25:501\u2013504","journal-title":"J Comb Optim"},{"key":"9895_CR10","doi-asserted-by":"crossref","unstructured":"Furma\u0144czyk H (2004) The equitable coloring of graphs In: Kubale M (ed) Graph colorings, 352. Contemporary Mathematics, AMS, Ann Arbor","DOI":"10.1090\/conm\/352\/03"},{"key":"9895_CR11","doi-asserted-by":"crossref","unstructured":"Kierstead HA, Kostochka AV (2008a) A short proof of the Hajnal-Szemer $$\\acute{e}$$ e \u00b4 di theorem on equitable coloring. Comb Probab Comput 17(2):265\u2013270","DOI":"10.1017\/S0963548307008619"},{"key":"9895_CR12","doi-asserted-by":"crossref","unstructured":"Kierstead HA, Kostochka AV (2008b) An Ore-type theorem on equitable coloring. J Comb Theory Ser B 98:226\u2013234","DOI":"10.1016\/j.jctb.2007.07.003"},{"issue":"1\u20133","key":"9895_CR13","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0012-365X(88)90210-5","volume":"72","author":"F Kitagawa","year":"1988","unstructured":"Kitagawa F, Ikeda H (1988) An existential problem of a weight-controlled subset and its application to schedule timetable construction. Discret Math 72(1\u20133):195\u2013211","journal-title":"Discret Math"},{"issue":"1\u20133","key":"9895_CR14","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/S0012-365X(02)00538-1","volume":"258","author":"AV Kostochka","year":"2002","unstructured":"Kostochka AV (2002) Equitable colorings of outerplanar graphs. Discret Math 258(1\u20133):373\u2013377","journal-title":"Discret Math"},{"issue":"2\u20133","key":"9895_CR15","first-page":"307","volume":"113","author":"PCB Lam","year":"2001","unstructured":"Lam PCB, Shiu WC, Tong CS, Zhang CF (2001) On the equitable chromatic number of complete $$n$$ n -partite graphs. Discret Appl Math 113(2\u20133):307\u2013310","journal-title":"Discret Appl Math"},{"key":"9895_CR16","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1007\/978-1-4419-7997-1_25","volume-title":"Handbook of combinatorial optimization","author":"KW Lih","year":"2013","unstructured":"Lih KW (2013) Equitable coloring of graphs. In: Pardalos PM, Du D-Z, Graham R (eds) Handbook of combinatorial optimization, 2nd edn. Springer, New York, pp 1199\u20131248","edition":"2"},{"issue":"1\u20133","key":"9895_CR17","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0012-365X(94)00092-W","volume":"151","author":"KW Lih","year":"1996","unstructured":"Lih KW, Wu PL (1996) On equitable coloring of bipartite graphs. Discrete Math 151(1\u20133):155\u2013160","journal-title":"Discrete Math"},{"key":"9895_CR18","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.dam.2011.09.020","volume":"160","author":"WH Lin","year":"2012","unstructured":"Lin WH, Chang GJ (2012) Equitable colorings of Cartesian products of graphs. Discret Appl Math 160:239\u2013247","journal-title":"Discret Appl Math"},{"key":"9895_CR19","doi-asserted-by":"crossref","first-page":"920","DOI":"10.2307\/2319405","volume":"80","author":"W Meyer","year":"1973","unstructured":"Meyer W (1973) Equitable colorings. Am Math Mon 80:920\u2013922","journal-title":"Am Math Mon"},{"key":"9895_CR20","doi-asserted-by":"crossref","first-page":"515","DOI":"10.4153\/CJM-1957-060-7","volume":"9","author":"G Sabidussi","year":"1957","unstructured":"Sabidussi G (1957) Graphs with given group and given graph-theoretical properties. Can J Math 9:515\u2013525","journal-title":"Can J Math"},{"key":"9895_CR21","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1016\/j.dam.2008.08.030","volume":"157","author":"CL Tong","year":"2009","unstructured":"Tong CL, Lin XH, Yang YS, Li ZH (2009) Equitable total coloring of $$C_{m}\\Box C_{n}$$ C m \u25a1 C n . Discret Appl Math 157:596\u2013601","journal-title":"Discret Appl Math"},{"key":"9895_CR22","doi-asserted-by":"crossref","first-page":"773","DOI":"10.11650\/tjm.18.2014.3645","volume":"18","author":"Z Yan","year":"2014","unstructured":"Yan Z, Lin WH, Wang W (2014) The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4. Taiwan J Math 18:773\u2013780","journal-title":"Taiwan J Math"},{"key":"9895_CR23","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/j.dam.2013.08.042","volume":"162","author":"Z Yan","year":"2014","unstructured":"Yan Z, Wang W (2014) Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs. Discret Appl Math 162:328\u2013333","journal-title":"Discret Appl Math"},{"key":"9895_CR24","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2298\/AADM150202003Z","volume":"9","author":"L Zuo","year":"2015","unstructured":"Zuo L, He S, Xue B (2015) The linear $$(n-1)$$ ( n - 1 ) -arboricity of Cartesian product graphs. Appl Anal Discret Math 9:13\u201328","journal-title":"Appl Anal Discret Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9895-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9895-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9895-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T20:07:00Z","timestamp":1566677220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9895-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,13]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9895"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9895-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,13]]}}}