On an Algorithm for Comparing the Chromatic Symmetric Functions of Trees

zbMath1434.05036arXiv1801.07363MaRDI QIDQ5206924

Simon Heil, Caleb Ji

Publication date: 19 December 2019

Full work available at URL: https://arxiv.org/abs/1801.07363

zbMATH Keywords

chromatic symmetric functionunrooted tree

Mathematics Subject Classification ID

Trees (05C05) Symmetric functions and generalizations (05E05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (13)

On the \(e\)-positivity of trees and spiders ⋮ A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function ⋮ A note on distinguishing trees with the chromatic symmetric function ⋮ Marked Graphs and the Chromatic Symmetric Function ⋮ Quasisymmetric functions distinguishing trees ⋮ A rooted variant of Stanley's chromatic symmetric function ⋮ On the smallest trees with the same restricted \(U\)-polynomial and the rooted \(U\)-polynomial ⋮ Extended chromatic symmetric functions and equality of ribbon Schur functions ⋮ Schur and \(e\)-positivity of trees and cut vertices ⋮ Modular relations of the Tutte symmetric function ⋮ Bijective Proofs of Proper Coloring Theorems ⋮ A Complete Multipartite Basis for the Chromatic Symmetric Function ⋮ The \(e\)-positivity and Schur positivity of some spiders and broom trees

Cites Work

• Unnamed Item
• Proper caterpillars are distinguished by their chromatic symmetric function
• Graphs with equal chromatic symmetric functions
• A symmetric function generalization of the chromatic polynomial of a graph
• On distinguishing trees by their chromatic symmetric functions
• Explicit Bounds for Some Functions of Prime Numbers

This page was built for publication: On an Algorithm for Comparing the Chromatic Symmetric Functions of Trees