Polychromatic polynomials
From MaRDI portal
\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.
Recommendations
- scientific article; zbMATH DE number 4091530
- Chromatic polynomials
- scientific article; zbMATH DE number 4128831
- scientific article; zbMATH DE number 1822500
- Generalized chromatic polynomials
- scientific article; zbMATH DE number 4181365
- Chromatic polynomials of hypergraphs
- Chromatic polynomials of hypergraphs
- Chromatic polynomials of mixed hypercycles
- Chromatic polynomials of simplicial complexes
Cited in
(25)- A tree distinguishing polynomial
- Simultaneous Polaczek polynomials
- Polynomial invariants for trees. A statistical mechanics approach
- A partition of connected graphs
- On graphs with the same restricted \(U\)-polynomial and the \(U\)-polynomial for rooted graphs
- Polychromatic sets and its application in simulating complex objects and systems
- Polynomial invariants of graphs. II
- Weakly distinguishing graph polynomials on addable properties
- On the smallest trees with the same restricted U-polynomial and the rooted U-polynomial
- Thomas H. Brylawski (1944--2007)
- On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem
- The lattice polynomial of a graph.
- On counting generalized colorings
- q-polynomial invariant of rooted trees
- The equivalence of two graph polynomials and a symmetric function
- scientific article; zbMATH DE number 14020 (Why is no real title available?)
- Tutte polynomials for trees
- scientific article; zbMATH DE number 475577 (Why is no real title available?)
- Harary polynomials
- On weakly distinguishing graph polynomials
- The U, V, and W polynomials
- A rooted variant of Stanley's chromatic symmetric function
- Planar polynomial of the graphs
- Polynomial invariants for rooted trees related to their random destruction
- Graph polynomials and local graph operations
This page was built for publication: Polychromatic polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567655)
