A well-known open problem in graph theory asks whether Stanley’s chromatic symmetric function, a generalization of the chromatic polynomial of a graph, distinguishes between any two nonisomorphic trees. Previous work has proven the conjecture for a class of trees called spiders. This paper generalizes the class of spiders to -spiders, where normal spiders correspond to , and verifies the conjecture for .
"A few more trees the chromatic symmetric function can distinguish." Involve 13 (1) 109 - 116, 2020. https://doi.org/10.2140/involve.2020.13.109