Chromatic polynomials of complementary (n,k)-clique pairs

Details Chromatic polynomials of complementary (n,k)-clique pairs Chromatic polynomials of complementary (n,k)-clique pairs

2010-12-17

arxiv.org/abs/1012.3847v3

Mathematics

Combinatorics

Replaced by a longer version, containing this note as a subsection

Scientific paper

We introduce a class of pairs of graphs consisting of two cliques joined by an arbitrary number of edges. The members of a pair have the property that the clique-bridging edge-set of one graph is the complement of that of the other. We prove a precise relation between the chromatic polynomials of the graphs in such a pair, showing that they have the same splitting field, and that the number of acyclic orientations of each graph is determined by the number of proper vertex-colourings of the other.

Affiliated with

Also associated with

No associations

Rating

Chromatic polynomials of complementary (n,k)-clique pairs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Chromatic polynomials of complementary (n,k)-clique pairs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Chromatic polynomials of complementary (n,k)-clique pairs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-638629