{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:15Z","timestamp":1740107115515,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T00:00:00Z","timestamp":1671408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T00:00:00Z","timestamp":1671408000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Nature Science Foundation of Shandong Province","award":["ZR2021MA012"],"award-info":[{"award-number":["ZR2021MA012"]}]},{"name":"Nature Science Foundation of Shandong Province","award":["ZR2021MA103"],"award-info":[{"award-number":["ZR2021MA103"]}]},{"name":"the Natural Science Research Foundation of Colleges and Universities of Anhui Province","award":["KJ2021A0968"],"award-info":[{"award-number":["KJ2021A0968"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s00373-022-02598-5","type":"journal-article","created":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T13:05:11Z","timestamp":1671455111000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Generalization of Gr\u00f6tzsch Theorem on the Local-Equitable Coloring"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7019-4195","authenticated-orcid":false,"given":"Zuosong","family":"Liang","sequence":"first","affiliation":[]},{"given":"Juan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chunsong","family":"Bai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,19]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"G. Bacs\u00f3, Zs. Tuza, Clique-transversal sets and weak 2-colorings in graphs of small maximum degree, Disc. Math. Theoret. Comput. Sci. 11(2), 15\u201324 (2009)","key":"2598_CR1","DOI":"10.46298\/dmtcs.453"},{"key":"2598_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1137\/S0895480199359995","volume":"17","author":"G Bacs\u00f3","year":"2004","unstructured":"Bacs\u00f3, G., Gravier, S., Gy\u00e1rf\u00e1s, A., Preissmann, M., Seb\u0151, A.: Coloring the maximal cliques of graphs. SIAM J. Disc. Math. 17, 361\u2013376 (2004)","journal-title":"SIAM J. Disc. Math."},{"doi-asserted-by":"crossref","unstructured":"G. Bacs\u00f3, Z. Ryj\u00e1$$\\check{c}$$ek, Zs. Tuza, Coloring the cliques of line graphs, Discr. Math. 340, 2641\u20132649 (2007)","key":"2598_CR3","DOI":"10.1016\/j.disc.2016.11.011"},{"key":"2598_CR4","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1016\/j.jctb.2015.09.008","volume":"116","author":"P Charbit","year":"2016","unstructured":"Charbit, P., Penev, I., Thomass\u00e9, S., Trotignon, N.: Perfect graphs of arbitrarily large clique-chromatic number. J. Combin. Theory Ser. B 116, 456\u2013464 (2016)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2598_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1002\/jgt.22110","volume":"86","author":"M Chudnovsky","year":"2017","unstructured":"Chudnovsky, M., Lo, I.: Decomposing and clique-coloring (diamond, odd-hole)-free graphs. J. Graph Theory 86, 5\u201341 (2017)","journal-title":"J. Graph Theory"},{"key":"2598_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1002\/jgt.20177","volume":"53","author":"D D\u00e9fossez","year":"2006","unstructured":"D\u00e9fossez, D.: Clique coloring some classess of odd-hole-free graphs. J. Graph Theory 53, 233\u2013249 (2006)","journal-title":"J. Graph Theory"},{"key":"2598_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/jgt.20387","volume":"62","author":"D D\u00e9fossez","year":"2009","unstructured":"D\u00e9fossez, D.: Complexity of clique coloring odd-hole-free graphs. J. Graph Theory 62, 139\u2013156 (2009)","journal-title":"J. Graph Theory"},{"unstructured":"H. Gr\u00f6tzsch, Ein dreifarbensatz, Ein dreifarbensatz fur dreikreisfreienetze auf der kugel, Math. Nat. Reihe 8 109\u2013120 (1959)","key":"2598_CR8"},{"doi-asserted-by":"crossref","unstructured":"J. Kratochv\u00edl, Zs. Tuza, On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45, 40-54 (2002)","key":"2598_CR9","DOI":"10.1016\/S0196-6774(02)00221-3"},{"key":"2598_CR10","doi-asserted-by":"publisher","first-page":"1473","DOI":"10.1007\/s00373-015-1657-8","volume":"32","author":"Z Liang","year":"2016","unstructured":"Liang, Z., Shan, E., Kang, L.: Clique-coloring claw-free graphs. Graph Combin. 32, 1473\u20131488 (2016)","journal-title":"Graph Combin."},{"key":"2598_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10878-015-9941-3","volume":"33","author":"Z Liang","year":"2017","unstructured":"Liang, Z., Shan, E., Zhang, Y.: A linear-time algorithm for clique-coloring problem in circular-arc graphs. J. Comb. Optim. 33, 147\u2013155 (2017)","journal-title":"J. Comb. Optim."},{"key":"2598_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.111777","volume":"343","author":"Z Liang","year":"2020","unstructured":"Liang, Z., Wu, J., Shan, E.: List-coloring clique-hypergraphs of $$K_5$$-minor-free graphs strongly. Discrete Math. 343, 111777 (2020)","journal-title":"Discrete Math."},{"key":"2598_CR13","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2022.01.006","volume":"906","author":"Z Liang","year":"2022","unstructured":"Liang, Z., Wang, J., Cai, J., Yang, X.: On the complexity of local-equitable coloring of graphs. Theoret. Comput. Sci. 906, 76\u201382 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"2598_CR14","doi-asserted-by":"publisher","first-page":"3487","DOI":"10.1016\/j.tcs.2011.02.038","volume":"412","author":"D Marx","year":"2011","unstructured":"Marx, D.: Complexity of clique coloring and related problems. Theor. Comput. Sci. 412, 3487\u20133500 (2011)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"B. Mohar, R. $$\\check{S}$$krekovski, The Gr\u00f6tzsch theorem for the hypergraph of maximal cliques, Electr. J. Combin. 6, #R26 (1999)","key":"2598_CR15","DOI":"10.37236\/1458"},{"key":"2598_CR16","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/jgt.21870","volume":"81","author":"I Penev","year":"2016","unstructured":"Penev, I.: Perfect graphs with no balanced skew-partition are 2-clique-colorable. J. Graph Theory 81, 213\u2013235 (2016)","journal-title":"J. Graph Theory"},{"key":"2598_CR17","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ejc.2013.08.003","volume":"36","author":"E Shan","year":"2014","unstructured":"Shan, E., Liang, Z., Kang, L.: Clique-transversal sets and clique-coloring in planar graphs. Eur. J. Combin. 36, 367\u2013376 (2014)","journal-title":"Eur. J. Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02598-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02598-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02598-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T21:46:10Z","timestamp":1677015970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02598-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,19]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["2598"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02598-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,12,19]]},"assertion":[{"value":"9 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 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":"All of the authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"4"}}