{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:04:59Z","timestamp":1740107099077,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T00:00:00Z","timestamp":1604880000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T00:00:00Z","timestamp":1604880000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Nature Science Foundation of China","doi-asserted-by":"crossref","award":["11601262"],"award-info":[{"award-number":["11601262"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801361"],"award-info":[{"award-number":["11801361"]}],"id":[{"id":"10.13039\/501100001809","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":[[2021,3]]},"DOI":"10.1007\/s00373-020-02253-x","type":"journal-article","created":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T10:06:01Z","timestamp":1604916361000},"page":"445-454","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Equitable Clique-Coloring in Claw-Free Graphs with Maximum Degree at Most 4"],"prefix":"10.1007","volume":"37","author":[{"given":"Zuosong","family":"Liang","sequence":"first","affiliation":[]},{"given":"Yanxia","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Yancai","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Huiyu","family":"Xing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,9]]},"reference":[{"key":"2253_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":"2253_CR2","first-page":"15","volume":"11","author":"G Bacs\u00f3","year":"2009","unstructured":"Bacs\u00f3, G., Tuza, Z.: Clique-transversal sets and weak 2-colorings in graphs of small maximum degree. Discrete Math. Theor. Comput. Sci. 11(2), 15\u201324 (2009)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"2253_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0095-8956(77)90002-8","volume":"22","author":"C Berge","year":"1977","unstructured":"Berge, C., Sterboul, F.: Equipartite colorings in graphs and hypergraphs. J. Combin. Theory (B) 22, 97\u2013113 (1977)","journal-title":"J. Combin. Theory (B)"},{"key":"2253_CR4","doi-asserted-by":"publisher","first-page":"2641","DOI":"10.1016\/j.disc.2016.11.011","volume":"340","author":"G Bacs\u00f3","year":"2007","unstructured":"Bacs\u00f3, G., Ryj\u00e1\u010dek, Z., Tuza, Z.: Coloring the cliques of line graphs. Discrete Math. 340, 2641\u20132649 (2007)","journal-title":"Discrete Math."},{"key":"2253_CR5","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":"2253_CR6","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":"2253_CR7","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1006\/eujc.1994.1047","volume":"15","author":"BL 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":"2253_CR8","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":"2253_CR9","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"},{"key":"2253_CR10","unstructured":"Hajnal, A., Szemer\u00e9di, E.: Proof of a conjecture of P. Erd\u00f6s, In: Erd\u00f6s, P., R\u00e9nyi, A., S\u00f3s V.T. (eds) Combinatorial theory and its application. North-Holland, London, pp. 601\u2013623 (1970)"},{"key":"2253_CR11","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. Theoret. Comput. Sci. 412, 3487\u20133500 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"2253_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J Mycielski","year":"1955","unstructured":"Mycielski, J.: Sur le coloriage des graphes. Colloq. Math. 3, 161\u2013162 (1955)","journal-title":"Colloq. Math."},{"key":"2253_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1017\/S0963548307008619","volume":"17","author":"HA Kierstead","year":"2008","unstructured":"Kierstead, H.A., Kostochka, A.V.: A short proof of the Hajnal-Szemer\u00e9di Theorem on equitable coloring. Combin. Probab. Comput. 17, 265\u2013270 (2008)","journal-title":"Combin. Probab. Comput."},{"key":"2253_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/jgt.20630","volume":"71","author":"HA Kierstead","year":"2012","unstructured":"Kierstead, H.A., Kostochka, A.V.: Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring. J. Graph Theory 71, 31\u201348 (2012)","journal-title":"J. Graph Theory"},{"key":"2253_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s00493-010-2483-5","volume":"30","author":"HA Kierstead","year":"2010","unstructured":"Kierstead, H.A., Kostochka, A.V., Mydlarz, M., Szemer\u00e9di, E.: A fast algorithm for equitable coloring. Combinatorica 30, 217\u2013224 (2010)","journal-title":"Combinatorica"},{"key":"2253_CR16","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, Z.: On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45, 40\u201354 (2002)","journal-title":"J. Algorithms"},{"key":"2253_CR17","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":"2253_CR18","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1007\/s00373-016-1726-7","volume":"32","author":"Z Liang","year":"2016","unstructured":"Liang, Z., Shan, E., Kang, L.: Clique-perfectness of claw-free planar graphs. Graph Combin. 32, 2551\u20132562 (2016)","journal-title":"Graph Combin."},{"key":"2253_CR19","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":"2253_CR20","doi-asserted-by":"publisher","first-page":"#R26","DOI":"10.37236\/1458","volume":"6","author":"B Mohar","year":"1999","unstructured":"Mohar, B., \u0160krekovski, R.: The Gr\u00f6tzsch theorem for the hypergraph of maximal cliques. Electr. J. Combin. 6, #R26 (1999)","journal-title":"Electr. J. Combin."},{"key":"2253_CR21","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":"2253_CR22","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":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02253-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02253-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02253-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T14:10:03Z","timestamp":1614262203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02253-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,9]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["2253"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02253-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,11,9]]},"assertion":[{"value":"8 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}