Unlabeled signed graph coloring

  title={Unlabeled signed graph coloring},
  author={Brian Davis},
  journal={Rocky Mountain Journal of Mathematics},
  • Brian Davis
  • Published 24 November 2015
  • Mathematics
  • Rocky Mountain Journal of Mathematics
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… 
2 Citations

Figures from this paper

Signed Chromatic Polynomials of Signed Book Graphs

In 2015, Matthias Beck and his team developed a computer program in SAGE which efficiently determines the number of signed proper $k$-colorings for a given signed graph. In this article, we determine

Nowhere-zero flows in signed graphs: A survey

We survey known results related to nowhere-zero flows and related topics, such as circuit covers and the structure of circuits of signed graphs. We include an overview of several different



Signed graph coloring

Orientation of Signed Graphs

Inside-out polytopes

The chromatic polynomial of an unlabeled graph

  • P. Hanlon
  • Mathematics
    J. Comb. Theory, Ser. B
  • 1985

Characteristic Polynomials of Subspace Arrangements and Finite Fields

Let A be any subspace arrangement in Rndefined over the integers and let Fqdenote the finite field withqelements. Letqbe a large prime. We prove that the characteristic polynomialχ(A, q) of A counts

Generators and relations for discrete groups

1. Cyclic, Dicyclic and Metacyclic Groups.- 2. Systematic Enumeration of Cosets.- 3. Graphs, Maps and Cayley Diagrams.- 4. Abstract Crystallography.- 5. Hyperbolic Tessellations and Fundamental

The Geometry of Root Systems and Signed Graphs

Acyclic orientations of graphs

E-mail address: Brian