Pages that link to "Item:Q2474494"

The following pages link to On distinguishing trees by their chromatic symmetric functions (Q2474494):

Displaying 48 items.

• A tree distinguishing polynomial (Q106322) (← links)
• Chromatic quasisymmetric functions (Q271744) (← links)
• Proper caterpillars are distinguished by their chromatic symmetric function (Q393186) (← links)
• Graphs with equal chromatic symmetric functions (Q394351) (← links)
• Greedy trees, subtrees and antichains (Q396846) (← links)
• Chromatic symmetric functions of hypertrees (Q528973) (← links)
• Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs (Q783748) (← links)
• Chromatic bases for symmetric functions (Q907267) (← links)
• A categorification of the chromatic symmetric function (Q1679330) (← links)
• Order quasisymmetric functions distinguish rooted trees (Q1686218) (← links)
• Counting Markov equivalence classes for DAG models on trees (Q1752602) (← links)
• On graphs with the same restricted \(U\)-polynomial and the \(U\)-polynomial for rooted graphs (Q1792094) (← links)
• Extended chromatic symmetric functions and equality of ribbon Schur functions (Q2035989) (← links)
• Chromatic posets (Q2049439) (← links)
• The \(e\)-positivity and Schur positivity of some spiders and broom trees (Q2104941) (← links)
• On the \(e\)-positivity of trees and spiders (Q2120825) (← links)
• \(H\)-chromatic symmetric functions (Q2121759) (← links)
• Plethysms of chromatic and Tutte symmetric functions (Q2161218) (← links)
• A combinatorial formula for the Schur coefficients of chromatic symmetric functions (Q2197479) (← links)
• Flip graphs, Yoke graphs and diameter (Q2209266) (← links)
• On the smallest trees with the same restricted \(U\)-polynomial and the rooted \(U\)-polynomial (Q2222953) (← links)
• Tutte polynomials for directed graphs (Q2284730) (← links)
• Schur and \(e\)-positivity of trees and cut vertices (Q2288162) (← links)
• A few more trees the chromatic symmetric function can distinguish (Q2299412) (← links)
• Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars (Q2327720) (← links)
• On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem (Q2400582) (← links)
• Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves (Q2412994) (← links)
• Plurigraph coloring and scheduling problems (Q2628259) (← links)
• Spiders and their kin: an investigation of Stanley's chromatic symmetric function for spiders and related graphs (Q2657070) (← links)
• A note on distinguishing trees with the chromatic symmetric function (Q2666579) (← links)
• The \(e\)-positivity of two classes of cycle-chord graphs (Q2701117) (← links)
• Combinatorial Hopf Algebras of Simplicial Complexes (Q2820857) (← links)
• Lollipop and Lariat Symmetric Functions (Q4641758) (← links)
• On an Algorithm for Comparing the Chromatic Symmetric Functions of Trees (Q5206924) (← links)
• Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions (Q5918292) (← links)
• Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions (Q5918952) (← links)
• Marked Graphs and the Chromatic Symmetric Function (Q6046819) (← links)
• Distance distributions and inverse problems for metric measure spaces (Q6089533) (← links)
• Quasisymmetric functions distinguishing trees (Q6101134) (← links)
• Tridiagonal maximum-entropy sampling and tridiagonal masks (Q6162032) (← links)
• The amazing chromatic polynomial (Q6169806) (← links)
• A rooted variant of Stanley's chromatic symmetric function (Q6177414) (← links)
• A class of trees determined by their chromatic symmetric functions (Q6553184) (← links)
• Proper \(q\)-caterpillars are distinguished by their chromatic symmetric functions (Q6589141) (← links)
• The chromatic symmetric function of a graph centred at a vertex (Q6635177) (← links)
• Quasysimmetric invariants for families of posets (Q6644903) (← links)
• Chromatic symmetric functions and polynomial invariants of trees (Q6647816) (← links)
• The \(e\)-positivity of some new classes of graphs (Q6658053) (← links)