{"paper":{"title":"Group Sum Chromatic Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marcin Anholcer, Sylwia Cichacz","submitted_at":"2012-05-11T16:48:13Z","abstract_excerpt":"We investigate the \\textit{group sum chromatic number} ($\\gchi(G)$) of graphs, i.e. the smallest value $s$ such that taking any Abelian group $\\gr$ of order $s$, there exists a function $f:E(G)\\rightarrow \\gr$ such that the sums of edge labels properly colour the vertices. It is known that $\\gchi(G)\\in\\{\\chi(G),\\chi(G)+1\\}$ for any graph $G$ with no component of order less than $3$ and we characterize the graphs for which $\\gchi(G)=\\chi(G)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2572","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}