Unlabeled signed graph coloring
From MaRDI portal
Abstract: 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3379174 (Why is no real title available?)
- Acyclic orientations of graphs
- Characteristic polynomials of subspace arrangements and finite fields
- Inside-out polytopes
- Orientation of signed graphs
- Signed graph coloring
- The Geometry of Root Systems and Signed Graphs
- The chromatic polynomial of an unlabeled graph
Cited in
(5)
This page was built for publication: Unlabeled signed graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2323915)