✦ LIBER ✦

The largest non-integer real zero of chromatic polynomials of graphs with fixed order

✍ Scribed by F.M Dong

Book ID: 108113396
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 438 KB
Volume: 282
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2003.11.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The largest real zero of the chromatic p

The largest real zero of the chromatic polynomial

✍ D.R. Woodall 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 507 KB

It is proved that if every subcontraction of a graph G contains a vertex with degree at most k, then the chromatic polynomial of G is positive throughout the interval (k, c~); Kk+l shows that this interval is the largest possible. It is conjectured that the largest real zero of the chromatic polynom

Integer Roots Chromatic Polynomials of N

Integer Roots Chromatic Polynomials of Non-Chordal Graphs and the Prouhet-Tarry-Escott Problem

✍ Santos Hernández; Florian Luca 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 84 KB

On the largest polytope of polynomials w

On the largest polytope of polynomials with a precise number of distinct real zeros

✍ C.B. Soh 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 353 KB

This paper presents a procedure to construct the largest polytope of polynomials with every polynomial having a precise number of distinct real zeros in a specific real line segment. This polytope can be specified from the zeros of a finite number of polynomials.

The chromatic equivalence classes of the

The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than

✍ Haicheng Ma; Haizhen Ren 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 170 KB