F. M. Dong

Learn More
Let G = (V, E) be a 2-connected plane graph on n vertices with outer face C such that every 2-vertex cut of G contains at least one vertex of C. Let P G (q) denote the chromatic polynomial of G. We show that (−1) n P G (q) > 0 for all 1 < q ≤ 1.2040.... This result is a corollary of a more general result that (−1) n Z G (q, w) > 0 for all 1 < q ≤ 1.2040...,(More)
  • 1