๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Domination numbers and zeros of chromatic polynomials

โœ Scribed by F.M. Dong; K.M. Koh

Book ID
108113821
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
202 KB
Volume
308
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Zero Knowledge and the Chromatic Number
Zero Knowledge and the Chromatic Number
โœ Uriel Feige; Joe Kilian ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 483 KB

We present a new technique, inspired by zero-knowledge proof systems, for proving lower bounds on approximating the chromatic number of a graph. To illustrate this technique we present simple reductions from max-3-coloring and max-3-sat, showing that it is hard to approximate the chromatic number wi

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

Number of zeros of interval polynomials
Number of zeros of interval polynomials
โœ Mingbo Zhang; Jiansong Deng ๐Ÿ“‚ Article ๐Ÿ“… 2013 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 341 KB
Circular Chromatic Numbers and Fractiona
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs
โœ G.J. Chang; L. Huang; X. Zhu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 171 KB

This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphs G(Z , D) for various distance sets D. In particular, we determine these numbers for those D sets of size two, for some special D sets of size three, for