𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A proof of the sendov conjecture for polynomials of degree seven

✍ Scribed by Brown, Johnny E.

Book ID
119999543
Publisher
Taylor and Francis Group
Year
1997
Weight
473 KB
Volume
33
Category
Article
ISSN
0278-1077

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Proof of a Chromatic Polynomial Conjectu
Proof of a Chromatic Polynomial Conjecture
✍ F.M. Dong πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 138 KB

Let P(G, \*) denote the chromatic polynomial of a graph G. It is proved in this paper that for every connected graph G of order n and real number \* n, (\*&2) n&1 P(G, \*)&\*(\*&1) n&2 P(G, \*&1) 0. By this result, the following conjecture proposed by Bartels and Welsh is proved: P(G, n)(P(G, n&1))