On Stanley's chromatic symmetric function and clawfree graphs
From MaRDI portal
Publication:1301848
DOI10.1016/S0012-365X(99)00106-5zbMath0934.05051WikidataQ126819458 ScholiaQ126819458MaRDI QIDQ1301848
Publication date: 9 April 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (14)
On the \(e\)-positivity of trees and spiders ⋮ Chromatic quasisymmetric functions ⋮ Marked Graphs and the Chromatic Symmetric Function ⋮ A local injective proof of log-concavity for increasing spanning forests ⋮ Macdonald polynomials and chromatic quasisymmetric functions ⋮ A combinatorial formula for the Schur coefficients of chromatic symmetric functions ⋮ Independence and upper irredundance in claw-free graphs ⋮ Covering Italian domination in graphs ⋮ Lollipop and Lariat Symmetric Functions ⋮ Chromatic symmetric functions in noncommuting variables revisited ⋮ Schur and \(e\)-positivity of trees and cut vertices ⋮ Chromatic posets ⋮ A new formula for Stanley's chromatic symmetric function for unit interval graphs and E-positivity for triangular ladder graphs ⋮ The \(e\)-positivity and Schur positivity of some spiders and broom trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inductive proofs of \(q\)-log concavity
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
- A symmetric function generalization of the chromatic polynomial of a graph
- On the numbers of independent \(k\)-sets in a claw free graph
- Combinatorial proof of the log-concavity of the sequence of matching numbers
- Incomparability graphs of \((3+1)\)-free posets are \(s\)-positive
- Theory of monomer-dimer systems
This page was built for publication: On Stanley's chromatic symmetric function and clawfree graphs
