On graphs with the same restricted \(U\)-polynomial and the \(U\)-polynomial for rooted graphs

DOI10.1016/j.endm.2018.06.032zbMath1397.05081OpenAlexW2883998275MaRDI QIDQ1792094

Anna de Mier, José Zamora, José Aliste-Prieto

Publication date: 11 October 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2018.06.032

zbMATH Keywords

\(U\)-polynomialchromatic symmetric functionStanley's conjecture

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31)

Related Items (1)

On the smallest trees with the same restricted \(U\)-polynomial and the rooted \(U\)-polynomial

Cites Work

• Proper caterpillars are distinguished by their chromatic symmetric function
• Intersection theory for graphs
• A weighted graph polynomial from chromatic invariants of knots
• Polychromatic polynomials
• The polychromate and a chord diagram polynomial
• A symmetric function generalization of the chromatic polynomial of a graph
• Cohomology classes of interval positroid varieties and a conjecture of Liu
• On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem
• On distinguishing trees by their chromatic symmetric functions

This page was built for publication: On graphs with the same restricted \(U\)-polynomial and the \(U\)-polynomial for rooted graphs