Marked Graphs and the Chromatic Symmetric Function
From MaRDI portal
Publication:6046819
DOI10.1137/22m148046xzbMath1520.05051arXiv2202.11787MaRDI QIDQ6046819
No author found.
Publication date: 6 September 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.11787
Related Items (2)
Marked Graphs and the Chromatic Symmetric Function ⋮ A rooted variant of Stanley's chromatic symmetric function
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chromatic quasisymmetric functions
- Proper caterpillars are distinguished by their chromatic symmetric function
- Graphs with equal chromatic symmetric functions
- The Tutte-Potts connection in the presence of an external magnetic field
- The kernel of chromatic quasisymmetric functions on graphs and hypergraphic polytopes
- Chromatic bases for symmetric functions
- A weighted graph polynomial from chromatic invariants of knots
- On Stanley's chromatic symmetric function and clawfree graphs
- A symmetric function generalization of the chromatic polynomial of a graph
- Extended chromatic symmetric functions and equality of ribbon Schur functions
- A deletion-contraction relation for the chromatic symmetric function
- Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars
- On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem
- On distinguishing trees by their chromatic symmetric functions
- A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function
- Lollipop and Lariat Symmetric Functions
- The connected partition lattice of a graph and the reconstruction conjecture
- On an Algorithm for Comparing the Chromatic Symmetric Functions of Trees
- Marked Graphs and the Chromatic Symmetric Function
This page was built for publication: Marked Graphs and the Chromatic Symmetric Function