Location of Zeros of Chromatic and Related Polynomials of Graphs
DOI10.4153/CJM-1994-002-3zbMATH Open0804.05034OpenAlexW1968435054MaRDI QIDQ4290192FDOQ4290192
Authors: Francesco Brenti, Gordon Royle, David G. Wagner 
Publication date: 3 May 1994
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1994-002-3
Recommendations
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Coloring of graphs and hypergraphs (05C15) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10)
Cited In (49)
- Chromatic zeros on hierarchical lattices and equidistribution on parameter space
- Chromatic polynomials and order ideals of monomials
- Counting the number of non-equivalent vertex colorings of a graph
- On linear transformations preserving the Pólya frequency property
- Two remarks on the adjoint polynomial
- On the unimodality of independence polynomials of some graphs
- On the independent domination polynomial of a graph
- \(\sigma\)-polynomials
- A bibliography on chromatic polynomials
- On the roots of \(\sigma\)-polynomials
- On the minimum real roots of the adjoint polynomial of a graph
- Graph-counting polynomials for oriented graphs
- A note on the shameful conjecture
- Blow-up algebras, determinantal ideals, and Dedekind-Mertens-like formulas
- The largest non-integer real zero of chromatic polynomials of graphs with fixed order
- Total non-negativity of some combinatorial matrices
- Zeros of rank-generating functions of Cohen-Macaulay complexes
- A matrix method for chromatic polynomials
- On Brenti's conjecture about the log-concavity of the chromatic polynomial
- On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
- On the roots of domination polynomials
- Improved bounds for the zeros of the chromatic polynomial via Whitney's broken circuit theorem
- Subdivisions and chromatic roots
- Polynomials with real zeros and compatible sequences
- Coefficients and roots of peak polynomials
- A proof of the peak polynomial positivity conjecture
- One more remark on the adjoint polynomial
- Monomial and toric ideals associated to Ferrers graphs
- On the roots of chromatic polynomials
- Bounds For The Real Zeros of Chromatic Polynomials
- The cycle-path indicator polynomial of a digraph
- Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs
- On the real roots of \(\sigma\)-polynomials
- On the unimodality of independence polynomials of very well-covered graphs
- Acyclic polynomials of graphs
- Hilbert polynomials in combinatorics
- On the roots of total domination polynomial of graphs
- General structural results for Potts model partition functions on lattice strips
- On the location of roots of graph polynomials
- A proof of the peak polynomial positivity conjecture
- A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\)
- Chromatic polynomials of random graphs
- Polynomials counting nowhere-zero chains in graphs
- The largest real zero of the chromatic polynomial
- Gale duality bounds for roots of polynomials with nonnegative coefficients
- Roots of cube polynomials of median graphs
- The roots of \(\sigma\)-polynomials
- Network reliability: Heading out on the highway
- Fubini numbers and polynomials of graphs
This page was built for publication: Location of Zeros of Chromatic and Related Polynomials of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290192)
