{"paper":{"title":"Weighted-Set Graph Colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.MP"],"primary_cat":"math-ph","authors_text":"Robert Shrock, Yan Xu","submitted_at":"2009-11-22T02:23:25Z","abstract_excerpt":"We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$ colors contained in the set of $q$ colors. We construct and analyze a weighted-set chromatic polynomial $Ph(G,q,s,w)$ associated with this coloring. General properties of this weighted-set chromatic polynomial are proved, and illustrative calculations are presented for various families of graphs. This study extends a previous one for the case $s=1$ and reveal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.4218","kind":"arxiv","version":1},"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"}