We extend the work of Hanlon on the chromatic polynomial of an unlabeled graph to define the unlabeled chromatic polynomial of an unlabeled signed graph. Explicit formulas are presented for labeled and unlabeled signed chromatic polynomials as summations over distinguished order-ideals of the signed partition lattice. We also define the quotient of a signed graph by a signed permutation, and show that its signed graphic arrangement is closely related to an induced arrangement on a distinguished subspace. Lastly, a formula for the number of unlabeled acyclic orientations of a signed graph is presented which recalls classical reciprocity theorems of Stanley and Zaslavsky.
"Unlabeled signed graph coloring." Rocky Mountain J. Math. 49 (4) 1111 - 1122, 2019. https://doi.org/10.1216/RMJ-2019-49-4-1111