On the Roots of σ-Polynomials
From MaRDI portal
Publication:2811197
DOI10.1002/jgt.21889zbMath1339.05113OpenAlexW1883961587MaRDI QIDQ2811197
Publication date: 10 June 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21889
Cites Work
- Two remarks on the adjoint polynomial
- Characterization of quadratic and cubic \(\sigma\)-polynomials
- The roots of the independence polynomial of a clawfree graph
- The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\)
- On the minimum real roots of the adjoint polynomial of a graph
- The partition polynomial of a finite set system
- On graphs having \(\sigma\)-polynomials of the same degree
- Rook theory. III: Rook polynomials and the chromatic structure of graphs
- Chromaticity of the complements of paths and cycles
- Adjoint polynomials and chromatically unique graphs
- On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
- \(\sigma\)-polynomials
- \(\sigma\)-polynomials and graph coloring
- Stirling numbers of forests and cycles
- Adjoint polynomials of bridge-path and bridge-cycle graphs and Chebyshev polynomials
- A note on the real part of complex chromatic roots
- Theory of monomer-dimer systems
- Expansions of Chromatic Polynomials and Log-Concavity
- Location of Zeros of Chromatic and Related Polynomials of Graphs
- Maximal σ‐polynomials of connected 3‐chromatic graphs
- Stirling Behavior is Asymptotically Normal
- Concavity properties and a generating function for stirling numbers
- An introduction to chromatic polynomials
- A note on coefficients of chromatic polynomials
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the Roots of σ-Polynomials
