๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the chromatic polynomial of a graph

โœ Scribed by David Avis; Caterina De Simone; Paolo Nobili

Publisher
Springer-Verlag
Year
2002
Tongue
English
Weight
121 KB
Volume
92
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Symmetric Function Generalization of t
A Symmetric Function Generalization of the Chromatic Polynomial of a Graph
โœ R.P. Stanley ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 932 KB

For a finite graph \(G\) with \(d\) vertices we define a homogeneous symmetric function \(X_{4 ;}\) of degree \(d\) in the variables \(x_{1}, x_{2}, \ldots\). If we set \(x_{1}=\cdots=x_{n}=1\) and all other \(x_{t}=0\), then we obtain \(Z_{1}(n)\), the chromatic polynomial of (; evaluated at \(n\).

On Chromatic Polynomials of Some Kinds o
On Chromatic Polynomials of Some Kinds of Graphs
โœ Rong-xia Hao; Yan-pei Liu ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Institute of Applied Mathematics, Chinese Academy ๐ŸŒ English โš– 159 KB
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