Regions without complex zeros for chromatic polynomials on graphs with bounded degree

Details Regions without complex zeros for chromatic polynomials on graphs with bounded degree Regions without complex zeros for chromatic polynomials on graphs with bounded degree

2007-04-19

arxiv.org/abs/0704.2617v1

Physics

Mathematical Physics

14 pages, to appear in Combinatorics, Probability and Computing

Scientific paper

We prove that the chromatic polynomial $P_\mathbb{G}(q)$ of a finite graph $\mathbb{G}$ of maximal degree $\D$ is free of zeros for $\card q\ge C^*(\D)$ with $$ C^*(\D) = \min_{0

Affiliated with

Also associated with

No associations

Rating

Regions without complex zeros for chromatic polynomials on graphs with bounded degree 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 Regions without complex zeros for chromatic polynomials on graphs with bounded degree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Regions without complex zeros for chromatic polynomials on graphs with bounded degree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-573120