✦ LIBER ✦

A note on approximating graph genus

✍ Scribed by Jianer Chen; Saroja P. Kanchi; Arkady Kanevsky

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 551 KB
Volume: 61
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(97)00203-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on Distance Approximating Trees i

A Note on Distance Approximating Trees in Graphs

✍ Victor Chepoi; Feodor Dragan 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 126 KB

A note on distance approximating trees i

A note on distance approximating trees in graphs

✍ V. Chepoi; F. Dragan 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 12 KB

A short note about pursuit games played

A short note about pursuit games played on a graph with a given genus

✍ A Quilliot 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 174 KB

On the maximum genus of a graph

✍ E.A Nordhaus; B.M Stewart; A.T White 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 415 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

Note on approximating complex zeros of a

Note on approximating complex zeros of a polynomial

✍ Bernard Friedman 📂 Article 📅 1949 🏛 John Wiley and Sons 🌐 English ⚖ 513 KB