{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T20:53:07Z","timestamp":1772484787915,"version":"3.50.1"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12301424"],"award-info":[{"award-number":["12301424"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.ejc.2026.104348","type":"journal-article","created":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T11:08:33Z","timestamp":1770203313000},"page":"104348","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Polynomials counting group colorings in graphs"],"prefix":"10.1016","volume":"134","author":[{"given":"Houshan","family":"Fu","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2026.104348_b1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.4007\/annals.2018.188.2.1","article-title":"Hodge theory for combinatorial geometries","volume":"188","author":"Adiprasito","year":"2018","journal-title":"Ann. of Math. (2)"},{"key":"10.1016\/j.ejc.2026.104348_b2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0095-8956(82)90078-8","article-title":"On the enumeration of chains in regular chain-groups","volume":"32","author":"Arrowsmith","year":"1982","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2026.104348_b3","doi-asserted-by":"crossref","first-page":"42","DOI":"10.2307\/1967597","article-title":"A determinant formula for the number of ways of coloring a map","volume":"14","author":"Birkhoff","year":"1912","journal-title":"Ann. of Math. (2)"},{"key":"10.1016\/j.ejc.2026.104348_b4","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1006\/aima.1997.1616","article-title":"M\u00f6bius functions of lattices","volume":"127","author":"Blass","year":"1997","journal-title":"Adv. Math."},{"key":"10.1016\/j.ejc.2026.104348_b5","article-title":"Graph theory","volume":"vol. 244","author":"Bondy","year":"2008"},{"key":"10.1016\/j.ejc.2026.104348_b6","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1090\/S0002-9947-1977-0468931-6","article-title":"The broken-circuit complex","volume":"234","author":"Brylawski","year":"1977","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.ejc.2026.104348_b7","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s00026-009-0037-6","article-title":"Orientations, lattice polytopes, and group arrangements I: chromatic and tension polynomials of graphs*","volume":"13","author":"Chen","year":"2010","journal-title":"Ann. Comb."},{"key":"10.1016\/j.ejc.2026.104348_b8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF01196637","article-title":"A broken-circuits-theorem for hypergraphs","volume":"64","author":"Dohmen","year":"1995","journal-title":"Arch. Math."},{"key":"10.1016\/j.ejc.2026.104348_b9","doi-asserted-by":"crossref","first-page":"18","DOI":"10.37236\/4356","article-title":"An abstraction of Whitney\u2019s broken circuit theorem","volume":"21","author":"Dohmen","year":"2014","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.ejc.2026.104348_b10","series-title":"Matroid Polynomials","first-page":"164","author":"Heron","year":"1972"},{"key":"10.1016\/j.ejc.2026.104348_b11","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0095-8956(74)90071-9","article-title":"Chromatic polynomials and logarithmic concavity","volume":"16","author":"Hoggar","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2026.104348_b12","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1090\/S0894-0347-2012-00731-0","article-title":"Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs","volume":"25","author":"Huh","year":"2012","journal-title":"J. Amer. Math. Soc."},{"key":"10.1016\/j.ejc.2026.104348_b13","doi-asserted-by":"crossref","first-page":"1103","DOI":"10.1007\/s00208-011-0777-6","article-title":"Log-concavity of characteristic polynomials and the Bergman fan of matroids","volume":"354","author":"Huh","year":"2012","journal-title":"Math. Ann."},{"key":"10.1016\/j.ejc.2026.104348_b14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0095-8956(92)90016-Q","article-title":"Group connectivity of graphs\u2013a nonhomongenous analogue of nowhere-zero flow properties","volume":"56","author":"Jaeger","year":"1992","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2026.104348_b15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/jgt.10038","article-title":"Tension polynomials of graphs","volume":"40","author":"Kochol","year":"2002","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2026.104348_b16","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0012-365X(03)00087-6","article-title":"Thesion-flow polynomials on graphs","volume":"274","author":"Kochol","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2026.104348_b17","doi-asserted-by":"crossref","DOI":"10.37236\/10445","article-title":"Polynomials counting nowhere-zero chains in graphs","volume":"29","author":"Kochol","year":"2022","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.ejc.2026.104348_b18","doi-asserted-by":"crossref","first-page":"3218","DOI":"10.3390\/math12203218","article-title":"Polynomials counting nowhere-zero chains associated with homomorphisms","volume":"12","author":"Kochol","year":"2024","journal-title":"Mathematics"},{"key":"10.1016\/j.ejc.2026.104348_b19","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/jgt.20098","article-title":"A note on group colorings","volume":"50","author":"Kr\u00e1l\u2019","year":"2005","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2026.104348_b20","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/jgt.20147","article-title":"Group chromatic number of planar graphs of girth at least 4","volume":"52","author":"Lai","year":"2006","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ejc.2026.104348_b21","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10114-010-9746-3","article-title":"Group connectivity and group colorings of graphs-a survey","volume":"27","author":"Lai","year":"2011","journal-title":"Acta Math. Sin. (Engl. Ser.)"},{"key":"10.1016\/j.ejc.2026.104348_b22","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1007\/s00373-021-02345-2","article-title":"Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions","volume":"37","author":"Lai","year":"2021","journal-title":"Graphs Combin."},{"key":"10.1016\/j.ejc.2026.104348_b23","doi-asserted-by":"crossref","first-page":"2535","DOI":"10.1137\/19M1300546","article-title":"A note on group colorings and group structure","volume":"35","author":"Lai","year":"2021","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.ejc.2026.104348_b24","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1016\/j.ejc.2004.11.001","article-title":"Group connectivity of graphs with diameter at most 2","volume":"27","author":"Lai","year":"2006","journal-title":"European J. Combin."},{"key":"10.1016\/j.ejc.2026.104348_b25","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s003730200009","article-title":"Group chromatic number of graphs without K5-minors","volume":"18","author":"Lai","year":"2002","journal-title":"Graphs Combin."},{"key":"10.1016\/j.ejc.2026.104348_b26","doi-asserted-by":"crossref","DOI":"10.37236\/8984","article-title":"Group connectivity and group coloring: small groups versus large groups","volume":"27","author":"Langhede","year":"2020","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.ejc.2026.104348_b27","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2023.103816","article-title":"Group coloring and group connectivity with non-isomorphic groups of the same order","volume":"119","author":"Langhede","year":"2024","journal-title":"European J. Combin."},{"key":"10.1016\/j.ejc.2026.104348_b28","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.disc.2012.09.009","article-title":"Group colorability of multigraphs","volume":"313","author":"Li","year":"2013","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2026.104348_b29","series-title":"Arrangements of Hyperplanes","author":"Orlik","year":"1992"},{"key":"10.1016\/j.ejc.2026.104348_b30","series-title":"Matroid Theory","author":"Oxley","year":"2011"},{"key":"10.1016\/j.ejc.2026.104348_b31","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/S0021-9800(68)80087-0","article-title":"An introduction to chromatic polynomials","volume":"4","author":"Read","year":"1968","journal-title":"J. Comb. Theory"},{"key":"10.1016\/j.ejc.2026.104348_b32","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BF00531932","article-title":"On the foundations of combinatorial theory I. Theory of M\u00f6bius functions","volume":"2","author":"Rota","year":"1964","journal-title":"Z. Wahrscheinlichkeitstheorie"},{"key":"10.1016\/j.ejc.2026.104348_b33","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1112\/plms\/s2-51.6.474","article-title":"On the imbedding of linear graphs in surfaces","volume":"51","author":"Tutte","year":"1949","journal-title":"Proc. Lond. Math. Soc. (2)"},{"key":"10.1016\/j.ejc.2026.104348_b34","doi-asserted-by":"crossref","first-page":"89","DOI":"10.4153\/CJM-1954-010-9","article-title":"A contribution to the theory of chromatic polynomials","volume":"6","author":"Tutte","year":"1954","journal-title":"Canad. J. Math."},{"key":"10.1016\/j.ejc.2026.104348_b35","doi-asserted-by":"crossref","first-page":"13","DOI":"10.4153\/CJM-1956-004-9","article-title":"A class of Abelian groups","volume":"8","author":"Tutte","year":"1956","journal-title":"Canad. J. Math."},{"key":"10.1016\/j.ejc.2026.104348_b36","doi-asserted-by":"crossref","first-page":"688","DOI":"10.2307\/1968214","article-title":"The coloring of graphs","volume":"33","author":"Whitney","year":"1932","journal-title":"Ann. Math."},{"key":"10.1016\/j.ejc.2026.104348_b37","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1090\/S0002-9904-1932-05460-X","article-title":"A logical expansion in mathematics","volume":"38","author":"Whitney","year":"1932","journal-title":"Bull. Amer. Math. Soc."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000168?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000168?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T19:53:35Z","timestamp":1772481215000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669826000168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":37,"alternative-id":["S0195669826000168"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104348","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Polynomials counting group colorings in graphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104348","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104348"}}