Polychromatic polynomials
type: Item
instance of: scholarly article
title: Polychromatic polynomials
zbMATH Open document ID: 0948.05035
DOI: 10.1016/S0012-365X(99)00363-5
author: Béla Bollobás
author: Oliver Riordan
published in: Discrete Mathematics
publication date: 2000-11-19T00:00:00Z
review text: \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.
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1462312
zbMATH Keywords: graph invariant
zbMATH Keywords: polychromate
zbMATH Keywords: Tutte polynomial
zbMATH Keywords: chromatic polynomial
reviewed by: Arthur T. White
MaRDI profile type: Publication
Recommended article: Q3819084
Recommended article: Chromatic polynomials
Recommended article: Q4207919
Recommended article: Q3153031
Recommended article: Generalized chromatic polynomials
Recommended article: Q3204485
Recommended article: Chromatic polynomials of hypergraphs
Recommended article: Chromatic polynomials of mixed hypercycles
Recommended article: Chromatic polynomials of simplicial complexes
description: scientific article; zbMATH DE number 1462312