The chromatic symmetric functions of trivially perfect graphs and cographs

DOI10.1007/s00373-018-1928-2zbMath1402.05081arXiv1707.04058OpenAlexW3101675724WikidataQ129497657 ScholiaQ129497657MaRDI QIDQ1756046

Shuhei Tsujie

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.04058

zbMATH Keywords

threshold graphclaw-freecographchromatic symmetric functiontrivially perfect graph\(e\)-positive

Mathematics Subject Classification ID

Graph polynomials (05C31) Symmetric functions and generalizations (05E05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (13)

Spiders and their kin: an investigation of Stanley's chromatic symmetric function for spiders and related graphs ⋮ A combinatorial formula for the Schur coefficients of chromatic symmetric functions ⋮ A rooted variant of Stanley's chromatic symmetric function ⋮ A graph polynomial from chromatic symmetric functions ⋮ Chromatic symmetric functions and \(H\)-free graphs ⋮ Characterization of general position sets and its applications to cographs and bipartite graphs ⋮ Chromatic symmetric functions in noncommuting variables revisited ⋮ On the \(e\)-positivity of \((claw, 2K_2)\)-free graphs ⋮ Schur and \(e\)-positivity of trees and cut vertices ⋮ A new formula for Stanley's chromatic symmetric function for unit interval graphs and E-positivity for triangular ladder graphs ⋮ Classes of graphs with \(e\)-positive chromatic symmetric function ⋮ A Complete Multipartite Basis for the Chromatic Symmetric Function ⋮ The \(e\)-positivity and Schur positivity of some spiders and broom trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic bases for symmetric functions
• Complement reducible graphs
• Trivially perfect graphs
• Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
• Order quasisymmetric functions distinguish rooted trees
• On immanants of Jacobi-Trudi matrices and permutations with restricted position
• A symmetric function generalization of the chromatic polynomial of a graph
• Quasi-threshold graphs
• Incomparability graphs of \((3+1)\)-free posets are \(s\)-positive
• The Comparability Graph of a Tree
• Free De Morgan Bisemigroups and Bisemilattices
• A Note on "The Comparability Graph of a Tree"
• An introduction to chromatic polynomials

This page was built for publication: The chromatic symmetric functions of trivially perfect graphs and cographs