Polychromatic polynomials (Q1567655)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1462312
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polychromatic polynomials |
scientific article; zbMATH DE number 1462312 |
Statements
Polychromatic polynomials (English)
0 references
19 November 2000
0 references
\textit{T. Brylawski} [J. Comb. Theory, Ser. B 30, 233-246 (1981; Zbl 0463.05031)] defined a graph invariant, called the polychromate, which provides information including the Tutte polynomial and hence the chromatic polynomial. The present authors refine the polychromate to a graph invariant incorporating a root vertex, and show that this rooted polychromate distinguishes all nonisomorphic rooted trees. They further refine to an invariant called the strong polychromate, which they conjecture uniquely identifies almost all graphs.
0 references
graph invariant
0 references
polychromate
0 references
Tutte polynomial
0 references
chromatic polynomial
0 references
0 references
0 references
0 references
0.9125261
0 references
0.91201234
0 references
