Polychromatic polynomials
From MaRDI portal
Publication:1567655
DOI10.1016/S0012-365X(99)00363-5zbMath0948.05035MaRDI QIDQ1567655
Publication date: 19 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (7)
On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem ⋮ A rooted variant of Stanley's chromatic symmetric function ⋮ On the smallest trees with the same restricted \(U\)-polynomial and the rooted \(U\)-polynomial ⋮ The Equivalence of Two Graph Polynomials and a Symmetric Function ⋮ Thomas H. Brylawski (1944--2007) ⋮ A tree distinguishing polynomial ⋮ On graphs with the same restricted \(U\)-polynomial and the \(U\)-polynomial for rooted graphs
This page was built for publication: Polychromatic polynomials
