Chromatic bounds on orbital chromatic roots
From MaRDI portal
Publication:463065
zbMath1298.05121arXiv1310.3792MaRDI QIDQ463065
Dae Hyun Kim, Alexander H. Mun, Mohamed Omar
Publication date: 23 October 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.3792
Graph polynomials (05C31) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Planar triangulations with real chromatic roots arbitrarily close to 4
- Orbital Chromatic and Flow Roots
- 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
- Chromatic Polynomials
This page was built for publication: Chromatic bounds on orbital chromatic roots