✦ LIBER ✦

On color polynomials of Fibonacci graphs

✍ Scribed by Sherif El-Basil

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 216 KB
Volume: 8
Category: Article
ISSN: 0192-8651
DOI: 10.1002/jcc.540080704

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ Sherif El-Basil 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

A recursion exists among the coefficients of the color polynomials of some of the families of graphs considered in recent work of Balasubramanian and Ramaraj.' Such families of graphs have been called Fibonacci graphs. Application to king patterns of lattices is given. The method described here appl

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

Minimum Coloring k-Colorable Graphs in P

Minimum Coloring k-Colorable Graphs in Polynomial Average Time

✍ C.R. Subramanian 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 137 KB

We present algorithms for minimum G -coloring k-colorable graphs drawn from random and semi-random models. In both models, an adversary initially splits Ž . the vertices into k color classes V , . . . , V of sizes ⍀ n each. In the first model,

On Total Colorings of Graphs

✍ C. Mcdiarmid; B. Reed 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 299 KB

AND Bruce Reed Department of Combinatorics and Optimisation, University of Waterloo, Waterloo, Ontario, Canada

On Wiener-type polynomials of thorn grap

On Wiener-type polynomials of thorn graphs

✍ Bo Zhou; Damir Vukičević 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

## Abstract We derive the expressions of the ordinary, the vertex‐weighted and the doubly vertex‐weighted Wiener polynomials of a type of thorn graph, for which the number of pendant edges attached to any vertex of the underlying parent graph is a linear function of its degree. We also define varia

Tension polynomials of graphs

✍ Martin Kochol 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB

The tension polynomial F G (k) of a graph G, evaluating the number of nowhere-zero Z k -tensions in G, is the nontrivial divisor of the chromatic polynomial G (k) of G, in that G (k) ¼ k c(G) F G (k), where c(G) denotes the number of components of G. We introduce the integral tension polynomial I G