The chromatic symmetric functions of trivially perfect graphs and cographs
From MaRDI portal
(Redirected from Publication:1756046)
Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph polynomials (05C31) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Symmetric functions and generalizations (05E05)
Abstract: Richard P. Stanley defined the chromatic symmetric function of a simple graph and has conjectured that every tree is determined by its chromatic symmetric function. Recently, Takahiro Hasebe and the author proved that the order quasisymmetric functions, which are analogs of the chromatic symmetric functions, distinguish rooted trees. In this paper, using a similar method, we prove that the chromatic symmetric functions distinguish trivially perfect graphs. Moreover, we also prove that claw-free cographs, that is, -free graphs belong to a known class of -positive graphs.
Recommendations
Cites work
- A Note on "The Comparability Graph of a Tree"
- A symmetric function generalization of the chromatic polynomial of a graph
- An introduction to chromatic polynomials
- Chromatic bases for symmetric functions
- Complement reducible graphs
- Free De Morgan Bisemigroups and Bisemilattices
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 739282 (Why is no real title available?)
- scientific article; zbMATH DE number 3895079 (Why is no real title available?)
- Incomparability graphs of \((3+1)\)-free posets are \(s\)-positive
- On immanants of Jacobi-Trudi matrices and permutations with restricted position
- Order quasisymmetric functions distinguish rooted trees
- Quasi-threshold graphs
- The Comparability Graph of a Tree
- Trivially perfect graphs
Cited in
(26)- On Stanley's chromatic symmetric function and clawfree graphs
- Order quasisymmetric functions distinguish rooted trees
- Chromatic symmetric functions and \(H\)-free graphs
- On the \(e\)-positivity of \((claw, 2K_2)\)-free graphs
- The \(e\)-positivity and Schur positivity of some spiders and broom trees
- Plethysms of chromatic and Tutte symmetric functions
- A combinatorial formula for the Schur coefficients of chromatic symmetric functions
- Characterization of general position sets and its applications to cographs and bipartite graphs
- Chromatic symmetric functions in noncommuting variables revisited
- 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
- Spiders and their kin: an investigation of Stanley's chromatic symmetric function for spiders and related graphs
- A note on distinguishing trees with the chromatic symmetric function
- Proper caterpillars are distinguished by their chromatic symmetric function
- Graphs with equal chromatic symmetric functions
- A complete multipartite basis for the chromatic symmetric function
- Marked Graphs and the Chromatic Symmetric Function
- A rooted variant of Stanley's chromatic symmetric function
- A graph polynomial from chromatic symmetric functions
- A class of trees determined by their chromatic symmetric functions
- Proper q-caterpillars are distinguished by their chromatic symmetric functions
- Chromatic symmetric functions of conjoined graphs
- Clocks are e-positive
- The e-positivity of the chromatic symmetric function for twinned paths and cycles
- On graphs with equal and different Kromatic symmetric functions
This page was built for publication: The chromatic symmetric functions of trivially perfect graphs and cographs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756046)