𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomial Approximation and Graph-Coloring

✍ Scribed by V. Th. Paschos

Publisher
Springer Vienna
Year
2003
Tongue
English
Weight
568 KB
Volume
70
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Οƒ-polynomials and graph coloring
Οƒ-polynomials and graph coloring
✍ Robert R Korfhage πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 781 KB
A Note on Graph Colorings and Graph Poly
A Note on Graph Colorings and Graph Polynomials
✍ Noga Alon; Michael Tarsi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 230 KB

## dedicated to professor w. t. tutte on the occasion of his eightieth birtday It is known that the chromatic number of a graph G=(V, E) with V= [1, 2, ..., n] exceeds k iff the graph polynomial f G => ij # E, i<j (x i &x j ) lies in certain ideals. We describe a short proof of this result, using

Polynomial approximation on graphs
Polynomial approximation on graphs
✍ A. G. O'Farrell; K. J. Preskenis; D. Walsh πŸ“‚ Article πŸ“… 1983 πŸ› Springer 🌐 English βš– 341 KB
Coloring graph bundles
Coloring graph bundles
✍ Sandi KlavΕΎar; Bojan Mohar πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 502 KB

## Abstract Graph bundles generalize the notion of covering graphs and products of graphs. Several results about the chromatic numbers of graph bundles based on the Cartesian product, the strong product and the tensor product are presented. Β© 1995 John Wiley & Sons, Inc.