A dense set of chromatic roots which is closed under multiplication by positive integers
From MaRDI portal
Publication:394542
DOI10.1016/J.DISC.2013.12.016zbMath1281.05087arXiv1108.2808OpenAlexW1995978086MaRDI QIDQ394542
Publication date: 27 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1108.2808
densitychromatic polynomialchromatic rootsclique-graphsclique-theta graphsgeneralised theta graphsrings of cliques
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Algebraic properties of chromatic roots
- Chromatic roots of a ring of four cliques
- Non-chordal graphs having integral-root chromatic polynomials. II
- Algebraic methods for chromatic polynomials.
- A matrix method for chromatic polynomials
- On the chromatic roots of generalized theta graphs
- Integer roots chromatic polynomials of non-chordal graphs and the Prouhet-Tarry-Escott prob\-lem
- A Zero-Free Interval for Chromatic Polynomials of Graphs
- The Zero-Free Intervals for Chromatic Polynomials of Graphs
- Chromatic Roots are Dense in the Whole Complex Plane
- An introduction to chromatic polynomials
This page was built for publication: A dense set of chromatic roots which is closed under multiplication by positive integers