Results 201 to 208 of about 1,406 (208)

Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions

Journal of Combinatorial Theory Series B, 2021
Kang-Ju Lee, Jaeseong Oh
exaly  

Caterpillars, ribbons, and the chromatic symmetric function

2009
For every n-vertex tree T, it is known that the chromatic polynomial x(T, k) is equal to k(k — l )ⁿ⁻¹. It is known that the function in noncommuting variables, Y[sub G](x), distinguishes all simple graphs. In the midground, the question of whether or not the chromatic symmetric function X[sub G](x) distinguishes nonisomorphic trees is still open.
openaire   +1 more source

Chromatic symmetric function of graphs from Borcherds algebras

Journal of Combinatorial Theory - Series A, 2021
G Arunkumar
exaly  

A combinatorial formula for the Schur coefficients of chromatic symmetric functions

Discrete Applied Mathematics, 2020
David G L Wang
exaly  

On $e$-Positivity and $e$-Unimodality of Chromatic Quasi-symmetric Functions

SIAM Journal on Discrete Mathematics, 2019
Soojin Cho
exaly  

A categorification of the chromatic symmetric function

Journal of Combinatorial Theory - Series A, 2018
Radmila Sazdanovic
exaly  

Noncommutative chromatic quasi-symmetric functions, Macdonald polynomials, and the Yang-Baxter equation

Journal of Combinatorial Theory - Series A
Jean-Christophe Novelli, Jean-Yves Thibon, Jean-Yves Thibon   +2 more
exaly  

A graph polynomial from chromatic symmetric functions

Journal of Graph Theory
Logan Crew
exaly