𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a general class of graph polynomials

✍ Scribed by E.J Farrell

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
697 KB
Volume
26
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Οƒ-polynomials and a class of chromati
On Οƒ-polynomials and a class of chromatically unique graphs
✍ Qingyan Du πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 655 KB

Du, Q., On o-polynomials and a class of chromatically unique graphs, Discrete Mathematics 115 (1993) 153-165. Let cr(G)=C:,,aicr '-' be the u-polynomial of a graph G. We ask the question: When k and a, are given, what is the largest possible value of ai(O < i < k) for any graph G? In this paper, thi

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

A general class of invulnerable graphs
A general class of invulnerable graphs
✍ F. T. Boesch; A. P. Felzer πŸ“‚ Article πŸ“… 1972 πŸ› John Wiley and Sons 🌐 English βš– 1004 KB

The idea of u t i Z i z i n g the connectivity properties of a graph as measures of i t s vulnerability has been welZ docwnented. graph t h e o r e t i c concepts and the b a s i c resuZts of t h i s theory are r e v i m e d here. are defined and compared. SpecificaZZy a class of graphs called teZe