{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:28Z","timestamp":1740107128866,"version":"3.37.3"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T00:00:00Z","timestamp":1723766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T00:00:00Z","timestamp":1723766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Nature Science Foundation of China","doi-asserted-by":"crossref","award":["12361067"],"award-info":[{"award-number":["12361067"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004607","name":"Natural Science Foundation of Guangxi Province","doi-asserted-by":"publisher","award":["2024GXNSFAA010506"],"award-info":[{"award-number":["2024GXNSFAA010506"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s00373-024-02826-0","type":"journal-article","created":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T07:02:18Z","timestamp":1723791738000},"update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Complexity of Local-Equitable Coloring in Claw-Free Graphs with Small Degree"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0001-7019-4195","authenticated-orcid":false,"given":"Zuosong","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"2826_CR1","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. Discrete Math. 17, 361\u2013376 (2004)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"2826_CR2","first-page":"15","volume":"11","author":"G Bacs\u00f3","year":"2009","unstructured":"Bacs\u00f3, G., Tuza, Zs.: Clique-transversal sets and weak 2-colorings in graphs of small maximum degree. Discrete Math. Theoret. Comput. Sci. 11(2), 15\u201324 (2009)","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"key":"2826_CR3","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":"2826_CR4","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/S0196-6774(02)00221-3","volume":"45","author":"J Kratochv\u00edl","year":"2002","unstructured":"Kratochv\u00edl, J., Tuza, Zs.: On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45, 40\u201354 (2002)","journal-title":"J. Algorithms"},{"key":"2826_CR5","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":"2826_CR6","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s00373-022-02598-5","volume":"39","author":"Z Liang","year":"2023","unstructured":"Liang, Z., Wang, J., Bai, C.: A generalization of Gr\u00f6tzsch Theorem on the local-equitable coloring. Graph Combin. 39, 4 (2023)","journal-title":"Graph Combin."},{"key":"2826_CR7","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s00373-020-02253-x","volume":"37","author":"Z Liang","year":"2021","unstructured":"Liang, Z., Dong, Y., Zhao, Y., Xing, H.: Equitable clique-coloring in claw-free graphs with maximum degree at most 4. Graph Combin. 37, 445\u2013454 (2021)","journal-title":"Graph Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02826-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/article\/10.1007\/s00373-024-02826-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02826-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T15:04:20Z","timestamp":1729782260000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/s00373-024-02826-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,16]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["2826"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s00373-024-02826-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,8,16]]},"assertion":[{"value":"27 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has not disclosed any Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"98"}}