𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial of graphs on surfaces

✍ Scribed by Béla Bollobás; Oliver Riordan

Publisher
Springer
Year
2002
Tongue
English
Weight
134 KB
Volume
323
Category
Article
ISSN
0025-5831

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomials on graphs
Polynomials on graphs
✍ Paul M. Weichsel 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 462 KB

Let G be a simple graph with adjacency matrix A, and p(x) a polynomial with rational coefficients. If p(A) is the adjacency matrix of a graph, we denote that graph by p(G). We consider the question: Given a graph 6, which polynomials p(r) give rise to a graph p(G) and what are those graphs? We give

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