Density of Chromatic Roots in Minor-Closed Graph Families
From MaRDI portal
Publication:4554778
Recommendations
- Chromatic roots and minor-closed families of graphs
- Chromatic roots and limits of dense graphs
- Densities of minor-closed graph families
- Chromaticity of some families of dense graphs
- scientific article; zbMATH DE number 867660
- Characterization for the chromaticity of a class of the dense graphs
- The chromatic number of dense random graphs
- Dense minors in graphs of large girth
- Minimum chromaticity of circulant graphs
- Minors in Graphs with High Chromatic Number
Cites work
- A Zero-Free Interval for Chromatic Polynomials of Graphs
- Chromatic Polynomials
- Chromatic Roots are Dense in the Whole Complex Plane
- Planar triangulations with real chromatic roots arbitrarily close to 4
- THE GOLDEN RATIO IN THE THEORY OF CHROMATIC POLYNOMIALS.
- The Zero-Free Intervals for Chromatic Polynomials of Graphs
- Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I: General theory and square-lattice chromatic polynomial.
- Über eine Eigenschaft der ebenen Komplexe
Cited in
(10)- Chromatic roots and minor-closed families of graphs
- Chromatic zeros and the golden ratio
- A dense set of chromatic roots which is closed under multiplication by positive integers
- Chromatic Roots are Dense in the Whole Complex Plane
- Chromatic roots and limits of dense graphs
- scientific article; zbMATH DE number 7593849 (Why is no real title available?)
- Approximating the chromatic polynomial is as hard as computing it exactly
- Densities of minor-closed graph families
- Improved bounds for the zeros of the chromatic polynomial via Whitney's broken circuit theorem
- Planar triangulations with real chromatic roots arbitrarily close to 4
This page was built for publication: Density of Chromatic Roots in Minor-Closed Graph Families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554778)
